Base | Representation |
---|---|
bin | 10111000000111101011010… |
… | …011110001000001101010011 |
3 | 111021101122010101000112110100 |
4 | 113000331122132020031103 |
5 | 101231401113100042321 |
6 | 555140142505503443 |
7 | 30214656016640535 |
oct | 2700753236101523 |
9 | 437348111015410 |
10 | 101221012112211 |
11 | 2a285654569162 |
12 | b4293881a1b83 |
13 | 446313c9c6834 |
14 | 1add1a1c03855 |
15 | ba7ecdeeb326 |
hex | 5c0f5a788353 |
101221012112211 has 6 divisors (see below), whose sum is σ = 146208128606540. Its totient is φ = 67480674741468.
The previous prime is 101221012112201. The next prime is 101221012112237. The reversal of 101221012112211 is 112211210122101.
It is a happy number.
101221012112211 is a `hidden beast` number, since 10 + 1 + 221 + 0 + 1 + 211 + 221 + 1 = 666.
It is not a de Polignac number, because 101221012112211 - 223 = 101221003723603 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101221012112201) 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 5 ways as a sum of consecutive naturals, for example, 5623389561781 + ... + 5623389561798.
Almost surely, 2101221012112211 is an apocalyptic number.
101221012112211 is a deficient number, since it is larger than the sum of its proper divisors (44987116494329).
101221012112211 is a wasteful number, since it uses less digits than its factorization.
101221012112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11246779123585 (or 11246779123582 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 101221012112211 its reverse (112211210122101), we get a palindrome (213432222234312).
The spelling of 101221012112211 in words is "one hundred one trillion, two hundred twenty-one billion, twelve million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •