Base | Representation |
---|---|
bin | 10110111111001100111010… |
… | …000111000110100111111011 |
3 | 111020222002022110202120010112 |
4 | 112333030322013012213323 |
5 | 101222411212242334321 |
6 | 555004443443534535 |
7 | 30203151311650130 |
oct | 2677147207064773 |
9 | 436862273676115 |
10 | 101100210121211 |
11 | 2a2393a3a33364 |
12 | b409a9398a44b |
13 | 445492a6102a2 |
14 | 1ad73c2174587 |
15 | ba4cad928a5b |
hex | 5bf33a1c69fb |
101100210121211 has 4 divisors (see below), whose sum is σ = 115543097281392. Its totient is φ = 86657322961032.
The previous prime is 101100210121187. The next prime is 101100210121223. The reversal of 101100210121211 is 112121012001101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101100210121211 - 26 = 101100210121147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101100210121411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7221443580080 + ... + 7221443580093.
It is an arithmetic number, because the mean of its divisors is an integer number (28885774320348).
Almost surely, 2101100210121211 is an apocalyptic number.
101100210121211 is a deficient number, since it is larger than the sum of its proper divisors (14442887160181).
101100210121211 is an equidigital number, since it uses as much as digits as its factorization.
101100210121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14442887160180.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101100210121211 its reverse (112121012001101), we get a palindrome (213221222122312).
The spelling of 101100210121211 in words is "one hundred one trillion, one hundred billion, two hundred ten million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •