Base | Representation |
---|---|
bin | 10110111101111001000000… |
… | …011000110110000110100011 |
3 | 111020122110210000102020022221 |
4 | 112331321000120312012203 |
5 | 101214422212001402321 |
6 | 554455224204011511 |
7 | 30163511652050230 |
oct | 2675710030660643 |
9 | 436573700366287 |
10 | 101010121122211 |
11 | 2a204174054a84 |
12 | b3b4531230b97 |
13 | 44492a12298a2 |
14 | 1ad2cb750a787 |
15 | ba278986be41 |
hex | 5bde406361a3 |
101010121122211 has 8 divisors (see below), whose sum is σ = 115462858430304. Its totient is φ = 86563063815360.
The previous prime is 101010121122203. The next prime is 101010121122259. The reversal of 101010121122211 is 112221121010101.
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 101010121122211 - 23 = 101010121122203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101010121122611) 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, 1419962200 + ... + 1420033333.
It is an arithmetic number, because the mean of its divisors is an integer number (14432857303788).
Almost surely, 2101010121122211 is an apocalyptic number.
101010121122211 is a deficient number, since it is larger than the sum of its proper divisors (14452737308093).
101010121122211 is an equidigital number, since it uses as much as digits as its factorization.
101010121122211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2840000621.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101010121122211 its reverse (112221121010101), we get a palindrome (213231242132312).
The spelling of 101010121122211 in words is "one hundred one trillion, ten billion, one hundred twenty-one million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.237 sec. • engine limits •