Base | Representation |
---|---|
bin | 10111001100010011000110… |
… | …011010010001011001111011 |
3 | 111101011010101011022020211221 |
4 | 113030103012122101121323 |
5 | 101332132413300334321 |
6 | 1000534130042132511 |
7 | 30325162225510435 |
oct | 2714230632213173 |
9 | 441133334266757 |
10 | 102000212121211 |
11 | 2a556057669848 |
12 | b5343a87b1137 |
13 | 44bb76a619811 |
14 | 1b28b9d91b655 |
15 | bbd3d61ece41 |
hex | 5cc4c669167b |
102000212121211 has 8 divisors (see below), whose sum is σ = 106435656681984. Its totient is φ = 97564821954600.
The previous prime is 102000212121191. The next prime is 102000212121229. The reversal of 102000212121211 is 112121212000201.
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 102000212121211 - 211 = 102000212119163 is a prime.
It is a super-2 number, since 2×1020002121212112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102000212521211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9743331 + ... + 17289676.
It is an arithmetic number, because the mean of its divisors is an integer number (13304457085248).
Almost surely, 2102000212121211 is an apocalyptic number.
102000212121211 is a deficient number, since it is larger than the sum of its proper divisors (4435444560773).
102000212121211 is a wasteful number, since it uses less digits than its factorization.
102000212121211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27197081.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102000212121211 its reverse (112121212000201), we get a palindrome (214121424121412).
The spelling of 102000212121211 in words is "one hundred two trillion, two hundred twelve million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •