Base | Representation |
---|---|
bin | 101011101100111100101… |
… | …110110000111101001101 |
3 | 101122002210020120112212100 |
4 | 223230330232300331031 |
5 | 343201023431011023 |
6 | 10215352420425313 |
7 | 426655056402660 |
oct | 53547456607515 |
9 | 11562706515770 |
10 | 3003201032013 |
11 | a58717764486 |
12 | 406059b48239 |
13 | 18a27ba703a0 |
14 | a54da0ad6d7 |
15 | 531c0797c43 |
hex | 2bb3cbb0f4d |
3003201032013 has 48 divisors (see below), whose sum is σ = 5429516077440. Its totient is φ = 1557256758912.
The previous prime is 3003201032011. The next prime is 3003201032087. The reversal of 3003201032013 is 3102301023003.
3003201032013 is a `hidden beast` number, since 3 + 0 + 0 + 320 + 10 + 320 + 13 = 666.
3003201032013 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3003201032013 - 21 = 3003201032011 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3003201032011) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 31027206 + ... + 31123847.
It is an arithmetic number, because the mean of its divisors is an integer number (113114918280).
Almost surely, 23003201032013 is an apocalyptic number.
It is an amenable number.
3003201032013 is a deficient number, since it is larger than the sum of its proper divisors (2426315045427).
3003201032013 is a wasteful number, since it uses less digits than its factorization.
3003201032013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62151138 (or 62151135 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 3003201032013 its reverse (3102301023003), we get a palindrome (6105502055016).
The spelling of 3003201032013 in words is "three trillion, three billion, two hundred one million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •