Base | Representation |
---|---|
bin | 10011000000000111… |
… | …010010001111111101 |
3 | 1221122220212000101010 |
4 | 103000013102033331 |
5 | 313241132120123 |
6 | 13212323105433 |
7 | 1321414450611 |
oct | 230007221775 |
9 | 57586760333 |
10 | 20403004413 |
11 | 871aa67220 |
12 | 3b54b12279 |
13 | 1c0202b89c |
14 | db7a2d341 |
15 | 7e6324993 |
hex | 4c01d23fd |
20403004413 has 8 divisors (see below), whose sum is σ = 29677097376. Its totient is φ = 12365457200.
The previous prime is 20403004411. The next prime is 20403004451. The reversal of 20403004413 is 31440030402.
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 20403004413 - 21 = 20403004411 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20403004413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20403004411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 309136398 + ... + 309136463.
It is an arithmetic number, because the mean of its divisors is an integer number (3709637172).
Almost surely, 220403004413 is an apocalyptic number.
It is an amenable number.
20403004413 is a deficient number, since it is larger than the sum of its proper divisors (9274092963).
20403004413 is a wasteful number, since it uses less digits than its factorization.
20403004413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 618272875.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 20403004413 its reverse (31440030402), we get a palindrome (51843034815).
The spelling of 20403004413 in words is "twenty billion, four hundred three million, four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •