Base | Representation |
---|---|
bin | 10111000000110101001110… |
… | …100010100101101001110011 |
3 | 111021100210102202220121002101 |
4 | 113000311032202211221303 |
5 | 101231230112314121321 |
6 | 555132130343401231 |
7 | 30214225133251261 |
oct | 2700651642455163 |
9 | 437323382817071 |
10 | 101212222020211 |
11 | 2a281953807a15 |
12 | b427734453217 |
13 | 446236b88c573 |
14 | 1adc9aa62d431 |
15 | ba7b67484791 |
hex | 5c0d4e8a5a73 |
101212222020211 has 8 divisors (see below), whose sum is σ = 101292199732944. Its totient is φ = 101132245436640.
The previous prime is 101212222020199. The next prime is 101212222020227. The reversal of 101212222020211 is 112020222212101.
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 101212222020211 - 27 = 101212222020083 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101212222020011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 348837381 + ... + 349127401.
It is an arithmetic number, because the mean of its divisors is an integer number (12661524966618).
Almost surely, 2101212222020211 is an apocalyptic number.
101212222020211 is a deficient number, since it is larger than the sum of its proper divisors (79977712733).
101212222020211 is a wasteful number, since it uses less digits than its factorization.
101212222020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564581.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 101212222020211 its reverse (112020222212101), we get a palindrome (213232444232312).
The spelling of 101212222020211 in words is "one hundred one trillion, two hundred twelve billion, two hundred twenty-two million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •