Base | Representation |
---|---|
bin | 10110111111100001011000… |
… | …110011111010010000100000 |
3 | 111021001012001222122011100102 |
4 | 112333201120303322100200 |
5 | 101223241231201120000 |
6 | 555022521455441532 |
7 | 30204560246005205 |
oct | 2677413063722040 |
9 | 437035058564312 |
10 | 101122200020000 |
11 | 2a24775872a835 |
12 | b4121b02262a8 |
13 | 4456a23336613 |
14 | 1ad84aa845cac |
15 | ba564920e3d5 |
hex | 5bf858cfa420 |
101122200020000 has 120 divisors (see below), whose sum is σ = 250038611341596. Its totient is φ = 40243554176000.
The previous prime is 101122200019993. The next prime is 101122200020011. The reversal of 101122200020000 is 20002221101.
It is a happy number.
It can be written as a sum of positive squares in 10 ways, for example, as 10303663444624 + 90818536575376 = 3209932^2 + 9529876^2 .
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 8892767 + ... + 16772766.
Almost surely, 2101122200020000 is an apocalyptic number.
101122200020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101122200020000 is an abundant number, since it is smaller than the sum of its proper divisors (148916411321596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101122200020000 is an equidigital number, since it uses as much as digits as its factorization.
101122200020000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25665760 (or 25665737 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 101122200020000 its reverse (20002221101), we get a palindrome (101142202241101).
The spelling of 101122200020000 in words is "one hundred one trillion, one hundred twenty-two billion, two hundred million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •