Base | Representation |
---|---|
bin | 1001010010010111000001… |
… | …0010101001111011011000 |
3 | 1100011011102121211222000120 |
4 | 2110211300102221323120 |
5 | 2314244132411413422 |
6 | 33414513421433240 |
7 | 2102502424065054 |
oct | 224456022517330 |
9 | 40134377758016 |
10 | 10211021201112 |
11 | 32875192a3796 |
12 | 118ab6a40b820 |
13 | 590b838b6074 |
14 | 274304c3cc64 |
15 | 12a92ac4345c |
hex | 949704a9ed8 |
10211021201112 has 32 divisors (see below), whose sum is σ = 26217486870000. Its totient is φ = 3311682551424.
The previous prime is 10211021201047. The next prime is 10211021201119. The reversal of 10211021201112 is 21110212011201.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10211021201091 and 10211021201100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211021201119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5749447987 + ... + 5749449762.
Almost surely, 210211021201112 is an apocalyptic number.
10211021201112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10211021201112 is an abundant number, since it is smaller than the sum of its proper divisors (16006465668888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10211021201112 is a wasteful number, since it uses less digits than its factorization.
10211021201112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11498897795 (or 11498897791 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10211021201112 its reverse (21110212011201), we get a palindrome (31321233212313).
The spelling of 10211021201112 in words is "ten trillion, two hundred eleven billion, twenty-one million, two hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •