Base | Representation |
---|---|
bin | 1001010010010111101110… |
… | …0110110000111100010101 |
3 | 1100011011220212000212110120 |
4 | 2110211323212300330111 |
5 | 2314300030010201401 |
6 | 33414544322142153 |
7 | 2102510220406035 |
oct | 224457346607425 |
9 | 40134825025416 |
10 | 10211211022101 |
11 | 3287606464041 |
12 | 118b001ab1959 |
13 | 590bb401818b |
14 | 2743221318c5 |
15 | 12a93c73b836 |
hex | 9497b9b0f15 |
10211211022101 has 16 divisors (see below), whose sum is σ = 13983026011968. Its totient is φ = 6623437824000.
The previous prime is 10211211022087. The next prime is 10211211022123. The reversal of 10211211022101 is 10122011211201.
It is a happy number.
It is not a de Polignac number, because 10211211022101 - 215 = 10211210989333 is a prime.
It is a super-2 number, since 2×102112110221012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211211022301) 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, 19194901 + ... + 19719701.
It is an arithmetic number, because the mean of its divisors is an integer number (873939125748).
Almost surely, 210211211022101 is an apocalyptic number.
It is an amenable number.
10211211022101 is a deficient number, since it is larger than the sum of its proper divisors (3771814989867).
10211211022101 is a wasteful number, since it uses less digits than its factorization.
10211211022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700132.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10211211022101 its reverse (10122011211201), we get a palindrome (20333222233302).
The spelling of 10211211022101 in words is "ten trillion, two hundred eleven billion, two hundred eleven million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •