Base | Representation |
---|---|
bin | 1001010010010011101000… |
… | …0110101101101011101101 |
3 | 1100011002002021012220020210 |
4 | 2110210322012231223231 |
5 | 2314240302144213401 |
6 | 33414243304333033 |
7 | 2102441044625523 |
oct | 224447206555355 |
9 | 40132067186223 |
10 | 10210112101101 |
11 | 32870a2116470 |
12 | 118a955a74179 |
13 | 590a6a454673 |
14 | 27425a1d4313 |
15 | 12a8c601a4d6 |
hex | 9493a1adaed |
10210112101101 has 16 divisors (see below), whose sum is σ = 15167052407808. Its totient is φ = 6056288286000.
The previous prime is 10210112101093. The next prime is 10210112101121. The reversal of 10210112101101 is 10110121101201.
It is not a de Polignac number, because 10210112101101 - 23 = 10210112101093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210112101121) 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, 3291459475 + ... + 3291462576.
It is an arithmetic number, because the mean of its divisors is an integer number (947940775488).
Almost surely, 210210112101101 is an apocalyptic number.
10210112101101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10210112101101 is a deficient number, since it is larger than the sum of its proper divisors (4956940306707).
10210112101101 is a wasteful number, since it uses less digits than its factorization.
10210112101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6582922112.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10210112101101 its reverse (10110121101201), we get a palindrome (20320233202302).
The spelling of 10210112101101 in words is "ten trillion, two hundred ten billion, one hundred twelve million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •