Base | Representation |
---|---|
bin | 10110110010011011001101… |
… | …001110011110110001011000 |
3 | 111010212011001010122122002111 |
4 | 112302123031032132301120 |
5 | 101114020041230311300 |
6 | 553053240410242104 |
7 | 30052546536103465 |
oct | 2662331516366130 |
9 | 433764033578074 |
10 | 100222210010200 |
11 | 29a30000843803 |
12 | b2a789b426334 |
13 | 43bcbb5967795 |
14 | 1aa6ad090066c |
15 | b8c022a079ba |
hex | 5b26cd39ec58 |
100222210010200 has 48 divisors (see below), whose sum is σ = 233195744673360. Its totient is φ = 40058070000000.
The previous prime is 100222210010173. The next prime is 100222210010207. The reversal of 100222210010200 is 2010012222001.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100222210010207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 192326676 + ... + 192847075.
It is an arithmetic number, because the mean of its divisors is an integer number (4858244680695).
Almost surely, 2100222210010200 is an apocalyptic number.
100222210010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100222210010200 is an abundant number, since it is smaller than the sum of its proper divisors (132973534663160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100222210010200 is a wasteful number, since it uses less digits than its factorization.
100222210010200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385175068 (or 385175059 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 100222210010200 its reverse (2010012222001), we get a palindrome (102232222232201).
The spelling of 100222210010200 in words is "one hundred trillion, two hundred twenty-two billion, two hundred ten million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •