Base | Representation |
---|---|
bin | 1001010101110000… |
… | …01100001101100101 |
3 | 110221110100212222002 |
4 | 10222320030031211 |
5 | 40232132343303 |
6 | 2145322415045 |
7 | 235155122243 |
oct | 45270141545 |
9 | 13843325862 |
10 | 5014340453 |
11 | 2143512221 |
12 | b7b361485 |
13 | 61bb0cc75 |
14 | 357d55793 |
15 | 1e533a788 |
hex | 12ae0c365 |
5014340453 has 4 divisors (see below), whose sum is σ = 5014507008. Its totient is φ = 5014173900.
The previous prime is 5014340449. The next prime is 5014340491. The reversal of 5014340453 is 3540434105.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5014340453 - 22 = 5014340449 is a prime.
It is a super-2 number, since 2×50143404532 = 50287220357184490418, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5014340413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24101 + ... + 103002.
It is an arithmetic number, because the mean of its divisors is an integer number (1253626752).
Almost surely, 25014340453 is an apocalyptic number.
It is an amenable number.
5014340453 is a deficient number, since it is larger than the sum of its proper divisors (166555).
5014340453 is a wasteful number, since it uses less digits than its factorization.
5014340453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166554.
The product of its (nonzero) digits is 14400, while the sum is 29.
The square root of 5014340453 is about 70812.0078305933. The cubic root of 5014340453 is about 1711.6091749012.
Adding to 5014340453 its reverse (3540434105), we get a palindrome (8554774558).
The spelling of 5014340453 in words is "five billion, fourteen million, three hundred forty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •