Base | Representation |
---|---|
bin | 101110100111110111… |
… | …1001101000011101000 |
3 | 100120102200020201010111 |
4 | 1131033233031003220 |
5 | 3120022214201440 |
6 | 113555002224104 |
7 | 10143055101061 |
oct | 1351757150350 |
9 | 316380221114 |
10 | 100122022120 |
11 | 395092a912a |
12 | 174a27b5034 |
13 | 9597b93b93 |
14 | 4bbb345568 |
15 | 290ecde4ea |
hex | 174fbcd0e8 |
100122022120 has 64 divisors (see below), whose sum is σ = 226927170000. Its totient is φ = 39755347968.
The previous prime is 100122022111. The next prime is 100122022123. The reversal of 100122022120 is 21220221001.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 17685276196 + 82436745924 = 132986^2 + 287118^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 100122022120.
It is not an unprimeable number, because it can be changed into a prime (100122022123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11874066 + ... + 11882494.
Almost surely, 2100122022120 is an apocalyptic number.
100122022120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100122022120 is an abundant number, since it is smaller than the sum of its proper divisors (126805147880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100122022120 is a wasteful number, since it uses less digits than its factorization.
100122022120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10582 (or 10578 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 100122022120 its reverse (21220221001), we get a palindrome (121342243121).
The spelling of 100122022120 in words is "one hundred billion, one hundred twenty-two million, twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •