Base | Representation |
---|---|
bin | 101110100111001101… |
… | …1001100110111000110 |
3 | 100120101010210221010200 |
4 | 1131032123030313012 |
5 | 3120001100014342 |
6 | 113552454231330 |
7 | 10142366654154 |
oct | 1351633146706 |
9 | 316333727120 |
10 | 100100001222 |
11 | 394a7928541 |
12 | 17497355546 |
13 | 9593453970 |
14 | 4bb84523d4 |
15 | 290cdde94c |
hex | 174e6ccdc6 |
100100001222 has 192 divisors, whose sum is σ = 250409263104. Its totient is φ = 28626877440.
The previous prime is 100100001203. The next prime is 100100001229. The reversal of 100100001222 is 222100001001.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100100001229) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 175306197 + ... + 175306767.
It is an arithmetic number, because the mean of its divisors is an integer number (1304214912).
Almost surely, 2100100001222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100100001222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125204631552).
100100001222 is an abundant number, since it is smaller than the sum of its proper divisors (150309261882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100100001222 is a wasteful number, since it uses less digits than its factorization.
100100001222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1083 (or 1080 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 100100001222 its reverse (222100001001), we get a palindrome (322200002223).
The spelling of 100100001222 in words is "one hundred billion, one hundred million, one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •