Base | Representation |
---|---|
bin | 1001000110000101010100… |
… | …1000101111101101011100 |
3 | 1022102000001000101200010110 |
4 | 2101201111020233231130 |
5 | 2302320212212033040 |
6 | 33133553234210020 |
7 | 2051325050246265 |
oct | 221412510575534 |
9 | 38360030350113 |
10 | 10000112221020 |
11 | 3206029712369 |
12 | 1156109423910 |
13 | 57701148a7ac |
14 | 268017dc196c |
15 | 1251d4c0d980 |
hex | 9185522fb5c |
10000112221020 has 48 divisors (see below), whose sum is σ = 28000618335648. Its totient is φ = 2666667628800.
The previous prime is 10000112221009. The next prime is 10000112221037. The reversal of 10000112221020 is 2012221100001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 10000112220987 and 10000112221005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4981602 + ... + 6694518.
It is an arithmetic number, because the mean of its divisors is an integer number (583346215326).
Almost surely, 210000112221020 is an apocalyptic number.
10000112221020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10000112221020 is an abundant number, since it is smaller than the sum of its proper divisors (18000506114628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000112221020 is a wasteful number, since it uses less digits than its factorization.
10000112221020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1810230 (or 1810228 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10000112221020 its reverse (2012221100001), we get a palindrome (12012333321021).
The spelling of 10000112221020 in words is "ten trillion, one hundred twelve million, two hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •