Base | Representation |
---|---|
bin | 1001000110000101101100… |
… | …0001101000100110110011 |
3 | 1022102000021220022012010202 |
4 | 2101201123001220212303 |
5 | 2302320413010121321 |
6 | 33134011123545415 |
7 | 2051330360110466 |
oct | 221413301504663 |
9 | 38360256265122 |
10 | 10000211020211 |
11 | 320607a463695 |
12 | 115613652b26b |
13 | 577028aa0859 |
14 | 26802717d2dd |
15 | 1251dd72770b |
hex | 9185b0689b3 |
10000211020211 has 8 divisors (see below), whose sum is σ = 10006688311200. Its totient is φ = 9993734076352.
The previous prime is 10000211020157. The next prime is 10000211020321. The reversal of 10000211020211 is 11202011200001.
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 10000211020211 - 26 = 10000211020147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10000211020192 and 10000211020201.
It is not an unprimeable number, because it can be changed into a prime (10000214020211) 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, 82926986 + ... + 83047488.
It is an arithmetic number, because the mean of its divisors is an integer number (1250836038900).
Almost surely, 210000211020211 is an apocalyptic number.
10000211020211 is a deficient number, since it is larger than the sum of its proper divisors (6477290989).
10000211020211 is a wasteful number, since it uses less digits than its factorization.
10000211020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173565.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10000211020211 its reverse (11202011200001), we get a palindrome (21202222220212).
The spelling of 10000211020211 in words is "ten trillion, two hundred eleven million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •