Base | Representation |
---|---|
bin | 10110110010011011000111… |
… | …110111111011011011101000 |
3 | 111010212010210212200102101122 |
4 | 112302123013313323123220 |
5 | 101114014400233242300 |
6 | 553053223441434412 |
7 | 30052544365611650 |
oct | 2662330767733350 |
9 | 433763725612348 |
10 | 100222120212200 |
11 | 29a2aa65090188 |
12 | b2a787533ba08 |
13 | 43bcba018677c |
14 | 1aa6ac2a07360 |
15 | b8c019bbac85 |
hex | 5b26c7dfb6e8 |
100222120212200 has 96 divisors (see below), whose sum is σ = 266306806761600. Its totient is φ = 34361570960640.
The previous prime is 100222120212101. The next prime is 100222120212241. The reversal of 100222120212200 is 2212021222001.
It is a happy 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 23 ways as a sum of consecutive naturals, for example, 212840621 + ... + 213310979.
It is an arithmetic number, because the mean of its divisors is an integer number (2774029237100).
Almost surely, 2100222120212200 is an apocalyptic number.
100222120212200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100222120212200 is an abundant number, since it is smaller than the sum of its proper divisors (166084686549400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100222120212200 is a wasteful number, since it uses less digits than its factorization.
100222120212200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 622579 (or 622570 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 100222120212200 its reverse (2212021222001), we get a palindrome (102434141434201).
The spelling of 100222120212200 in words is "one hundred trillion, two hundred twenty-two billion, one hundred twenty million, two hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •