Base | Representation |
---|---|
bin | 1001001100100110100011… |
… | …0110011000011010011100 |
3 | 1022210201010110221002010011 |
4 | 2103021220312120122130 |
5 | 2311134101144213040 |
6 | 33301235024253004 |
7 | 2062401364441546 |
oct | 223115066303234 |
9 | 38721113832104 |
10 | 10112112101020 |
11 | 3249582727966 |
12 | 1173965a71164 |
13 | 5847500bc237 |
14 | 26d600a2c696 |
15 | 12808c6933ea |
hex | 93268d9869c |
10112112101020 has 24 divisors (see below), whose sum is σ = 21235496734368. Its totient is φ = 4044833160000.
The previous prime is 10112112100999. The next prime is 10112112101089. The reversal of 10112112101020 is 2010121121101.
It is a happy number.
It is a super-2 number, since 2×101121121010202 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10846345 + ... + 11741695.
It is an arithmetic number, because the mean of its divisors is an integer number (884812363932).
Almost surely, 210112112101020 is an apocalyptic number.
10112112101020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10112112101020 is an abundant number, since it is smaller than the sum of its proper divisors (11123384633348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112112101020 is a wasteful number, since it uses less digits than its factorization.
10112112101020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1460061 (or 1460059 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10112112101020 its reverse (2010121121101), we get a palindrome (12122233222121).
The spelling of 10112112101020 in words is "ten trillion, one hundred twelve billion, one hundred twelve million, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •