Base | Representation |
---|---|
bin | 110111111110010011… |
… | …1000010101100110100 |
3 | 102111021002122221121102 |
4 | 1233330213002230310 |
5 | 3432133231210400 |
6 | 131115314305232 |
7 | 11453502633140 |
oct | 1577447025464 |
9 | 374232587542 |
10 | 120202210100 |
11 | 46a83017605 |
12 | 1b367588218 |
13 | b44806660b |
14 | 5b64142220 |
15 | 31d7ae99d5 |
hex | 1bfc9c2b34 |
120202210100 has 72 divisors (see below), whose sum is σ = 298362028608. Its totient is φ = 41176166400.
The previous prime is 120202210069. The next prime is 120202210111. The reversal of 120202210100 is 1012202021.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 732635 + ... + 881565.
It is an arithmetic number, because the mean of its divisors is an integer number (4143917064).
Almost surely, 2120202210100 is an apocalyptic number.
120202210100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120202210100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149181014304).
120202210100 is an abundant number, since it is smaller than the sum of its proper divisors (178159818508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120202210100 is a wasteful number, since it uses less digits than its factorization.
120202210100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150105 (or 150098 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 120202210100 its reverse (1012202021), we get a palindrome (121214412121).
The spelling of 120202210100 in words is "one hundred twenty billion, two hundred two million, two hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •