Base | Representation |
---|---|
bin | 10010101111111111… |
… | …001000001001001101 |
3 | 1220222001201102121212 |
4 | 102233333020021031 |
5 | 312212400233123 |
6 | 13125415504205 |
7 | 1311620556254 |
oct | 225777101115 |
9 | 56861642555 |
10 | 20132430413 |
11 | 85a1260a47 |
12 | 3a9a388065 |
13 | 1b8ac64724 |
14 | d8db1979b |
15 | 7cc6c9878 |
hex | 4affc824d |
20132430413 has 8 divisors (see below), whose sum is σ = 20519992248. Its totient is φ = 19748542464.
The previous prime is 20132430407. The next prime is 20132430427. The reversal of 20132430413 is 31403423102.
It can be written as a sum of positive squares in 4 ways, for example, as 1878528964 + 18253901449 = 43342^2 + 135107^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20132430413 - 24 = 20132430397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20132430463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 907406 + ... + 929327.
It is an arithmetic number, because the mean of its divisors is an integer number (2564999031).
Almost surely, 220132430413 is an apocalyptic number.
It is an amenable number.
20132430413 is a deficient number, since it is larger than the sum of its proper divisors (387561835).
20132430413 is a wasteful number, since it uses less digits than its factorization.
20132430413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1836943.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 20132430413 its reverse (31403423102), we get a palindrome (51535853515).
The spelling of 20132430413 in words is "twenty billion, one hundred thirty-two million, four hundred thirty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •