Base | Representation |
---|---|
bin | 10110101111010111011100… |
… | …111111111000101001110000 |
3 | 111010010001111201100212202011 |
4 | 112233113130333320221300 |
5 | 101102044104413101000 |
6 | 552412515511132304 |
7 | 30031426055634556 |
oct | 2657273477705160 |
9 | 433101451325664 |
10 | 100012021222000 |
11 | 29959950743198 |
12 | b272bbb674094 |
13 | 43a61297cb164 |
14 | 1a9a871595bd6 |
15 | b8681ed332ba |
hex | 5af5dcff8a70 |
100012021222000 has 40 divisors (see below), whose sum is σ = 241829067319632. Its totient is φ = 40004808488000.
The previous prime is 100012021221979. The next prime is 100012021222013. The reversal of 100012021222000 is 222120210001.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25003003306 + ... + 25003007305.
Almost surely, 2100012021222000 is an apocalyptic number.
100012021222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100012021222000 is an abundant number, since it is smaller than the sum of its proper divisors (141817046097632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100012021222000 is an equidigital number, since it uses as much as digits as its factorization.
100012021222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50006010634 (or 50006010618 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 100012021222000 its reverse (222120210001), we get a palindrome (100234141432001).
The spelling of 100012021222000 in words is "one hundred trillion, twelve billion, twenty-one million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •