Base | Representation |
---|---|
bin | 10110111110000011010000… |
… | …000101111001110001100011 |
3 | 111020200112011200112020200020 |
4 | 112332003100011321301203 |
5 | 101220112224213311321 |
6 | 554504243543124523 |
7 | 30164351402052054 |
oct | 2676032005716143 |
9 | 436615150466606 |
10 | 101021122010211 |
11 | 2a2088a9839a57 |
12 | b3b66a1443743 |
13 | 444a3353a5480 |
14 | 1ad363c56c72b |
15 | ba2bd05344c6 |
hex | 5be0d0179c63 |
101021122010211 has 8 divisors (see below), whose sum is σ = 145055970066000. Its totient is φ = 62166844313952.
The previous prime is 101021122010197. The next prime is 101021122010213. The reversal of 101021122010211 is 112010221120101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101021122010211 - 26 = 101021122010147 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101021122010213) 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, 1295142589836 + ... + 1295142589913.
It is an arithmetic number, because the mean of its divisors is an integer number (18131996258250).
Almost surely, 2101021122010211 is an apocalyptic number.
101021122010211 is a deficient number, since it is larger than the sum of its proper divisors (44034848055789).
101021122010211 is a wasteful number, since it uses less digits than its factorization.
101021122010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2590285179765.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101021122010211 its reverse (112010221120101), we get a palindrome (213031343130312).
The spelling of 101021122010211 in words is "one hundred one trillion, twenty-one billion, one hundred twenty-two million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •