Base | Representation |
---|---|
bin | 11101000111110110110… |
… | …010000010000000101011 |
3 | 21002022201001012221021212 |
4 | 131013312302002000223 |
5 | 230242130311300321 |
6 | 4131215022423335 |
7 | 264406040125313 |
oct | 35076662020053 |
9 | 7068631187255 |
10 | 2001300103211 |
11 | 701823809652 |
12 | 283a47431b4b |
13 | 11694ca07306 |
14 | 6cc133da443 |
15 | 370d21dd55b |
hex | 1d1f6c8202b |
2001300103211 has 8 divisors (see below), whose sum is σ = 2148051361104. Its totient is φ = 1857774147840.
The previous prime is 2001300103181. The next prime is 2001300103213. The reversal of 2001300103211 is 1123010031002.
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 2001300103211 - 26 = 2001300103147 is a prime.
It is a super-2 number, since 2×20013001032112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2001300103213) 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, 806324345 + ... + 806326826.
It is an arithmetic number, because the mean of its divisors is an integer number (268506420138).
Almost surely, 22001300103211 is an apocalyptic number.
2001300103211 is a deficient number, since it is larger than the sum of its proper divisors (146751257893).
2001300103211 is a wasteful number, since it uses less digits than its factorization.
2001300103211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1612651261.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 2001300103211 its reverse (1123010031002), we get a palindrome (3124310134213).
The spelling of 2001300103211 in words is "two trillion, one billion, three hundred million, one hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •