Base | Representation |
---|---|
bin | 1001000110001010110111… |
… | …01101011010110000110110 |
3 | 2121211021202111022221011001 |
4 | 10203011123231122300312 |
5 | 10110213024020031410 |
6 | 110313202133433514 |
7 | 4133116655622106 |
oct | 443053355326066 |
9 | 77737674287131 |
10 | 20003201330230 |
11 | 64123457398a8 |
12 | 22b090779b89a |
13 | b213a85c9b91 |
14 | 4d22354b1206 |
15 | 24a4e0e4833a |
hex | 12315bb5ac36 |
20003201330230 has 16 divisors (see below), whose sum is σ = 36843105706704. Its totient is φ = 7815204240480.
The previous prime is 20003201330207. The next prime is 20003201330237. The reversal of 20003201330230 is 3203310230002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 20003201330198 and 20003201330207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20003201330237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23259536001 + ... + 23259536860.
It is an arithmetic number, because the mean of its divisors is an integer number (2302694106669).
Almost surely, 220003201330230 is an apocalyptic number.
20003201330230 is a deficient number, since it is larger than the sum of its proper divisors (16839904376474).
20003201330230 is a wasteful number, since it uses less digits than its factorization.
20003201330230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46519072911.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 20003201330230 its reverse (3203310230002), we get a palindrome (23206511560232).
The spelling of 20003201330230 in words is "twenty trillion, three billion, two hundred one million, three hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •