Base | Representation |
---|---|
bin | 11101011001101010100… |
… | …01100110101110110101 |
3 | 10120120112100110011200111 |
4 | 32230311101212232311 |
5 | 113022403021401401 |
6 | 2052030134143021 |
7 | 132661654600216 |
oct | 16546521465665 |
9 | 3516470404614 |
10 | 1010211122101 |
11 | 35a47892a085 |
12 | 1439517b1a71 |
13 | 7435493581c |
14 | 36c7464540d |
15 | 1b427e28e51 |
hex | eb35466bb5 |
1010211122101 has 16 divisors (see below), whose sum is σ = 1095814355328. Its totient is φ = 927520499200.
The previous prime is 1010211122093. The next prime is 1010211122159. The reversal of 1010211122101 is 1012211120101.
It is a happy number.
It is not a de Polignac number, because 1010211122101 - 23 = 1010211122093 is a prime.
It is a super-2 number, since 2×10102111221012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010211122191) 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 15 ways as a sum of consecutive naturals, for example, 9489696 + ... + 9595558.
It is an arithmetic number, because the mean of its divisors is an integer number (68488397208).
Almost surely, 21010211122101 is an apocalyptic number.
It is an amenable number.
1010211122101 is a deficient number, since it is larger than the sum of its proper divisors (85603233227).
1010211122101 is a wasteful number, since it uses less digits than its factorization.
1010211122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119612.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1010211122101 its reverse (1012211120101), we get a palindrome (2022422242202).
The spelling of 1010211122101 in words is "one trillion, ten billion, two hundred eleven million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •