Base | Representation |
---|---|
bin | 1001001011111001011011… |
… | …1111000010100111111000 |
3 | 1022202112212110011122010110 |
4 | 2102332112333002213320 |
5 | 2310434300303033422 |
6 | 33251513154144320 |
7 | 2061462305610015 |
oct | 222762677024770 |
9 | 38675773148113 |
10 | 10100001221112 |
11 | 3244428423600 |
12 | 1171545b820a0 |
13 | 58356cca49ca |
14 | 26cbb23ca70c |
15 | 127ace31e60c |
hex | 92f96fc29f8 |
10100001221112 has 96 divisors (see below), whose sum is σ = 28504247662800. Its totient is φ = 2977887306240.
The previous prime is 10100001221029. The next prime is 10100001221119. The reversal of 10100001221112 is 21112210000101.
It is a super-2 number, since 2×101000012211122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100001221119) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 46892037 + ... + 47106932.
Almost surely, 210100001221112 is an apocalyptic number.
10100001221112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10100001221112 is an abundant number, since it is smaller than the sum of its proper divisors (18404246441688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100001221112 is a wasteful number, since it uses less digits than its factorization.
10100001221112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93999037 (or 93999022 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10100001221112 its reverse (21112210000101), we get a palindrome (31212211221213).
The spelling of 10100001221112 in words is "ten trillion, one hundred billion, one million, two hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •