Base | Representation |
---|---|
bin | 10111001111011000100010… |
… | …011110011000101111011011 |
3 | 111101220101120122220110202222 |
4 | 113033120202132120233123 |
5 | 101344121101241214321 |
6 | 1001215350250414255 |
7 | 30346405564556120 |
oct | 2717304236305733 |
9 | 441811518813688 |
10 | 102212210101211 |
11 | 2a627a55a319a1 |
12 | b5694b243138b |
13 | 4505754543c32 |
14 | 1b35151252747 |
15 | bc3b92b443ab |
hex | 5cf622798bdb |
102212210101211 has 12 divisors (see below), whose sum is σ = 120703701069936. Its totient is φ = 84784321737360.
The previous prime is 102212210101187. The next prime is 102212210101217. The reversal of 102212210101211 is 112101012212201.
It is a de Polignac number, because none of the positive numbers 2k-102212210101211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102212210101211.
It is not an unprimeable number, because it can be changed into a prime (102212210101217) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7597154720 + ... + 7597168173.
It is an arithmetic number, because the mean of its divisors is an integer number (10058641755828).
Almost surely, 2102212210101211 is an apocalyptic number.
102212210101211 is a deficient number, since it is larger than the sum of its proper divisors (18491490968725).
102212210101211 is an equidigital number, since it uses as much as digits as its factorization.
102212210101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15194322962 (or 15194322931 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 102212210101211 its reverse (112101012212201), we get a palindrome (214313222313412).
The spelling of 102212210101211 in words is "one hundred two trillion, two hundred twelve billion, two hundred ten million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •