Base | Representation |
---|---|
bin | 111000111010001001… |
… | …0111101000101010010 |
3 | 102200110001001220210220 |
4 | 1301310102331011102 |
5 | 4000241303211010 |
6 | 132050444533510 |
7 | 11554324434501 |
oct | 1616422750522 |
9 | 380401056726 |
10 | 122210210130 |
11 | 47913528768 |
12 | 1b827b51296 |
13 | b6a8082108 |
14 | 5cb4ac0838 |
15 | 32a403c970 |
hex | 1c744bd152 |
122210210130 has 128 divisors (see below), whose sum is σ = 318460336128. Its totient is φ = 29894925312.
The previous prime is 122210210123. The next prime is 122210210167. The reversal of 122210210130 is 31012012221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10674189 + ... + 10685631.
It is an arithmetic number, because the mean of its divisors is an integer number (2487971376).
Almost surely, 2122210210130 is an apocalyptic number.
122210210130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 122210210130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159230168064).
122210210130 is an abundant number, since it is smaller than the sum of its proper divisors (196250125998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122210210130 is a wasteful number, since it uses less digits than its factorization.
122210210130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12000.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 122210210130 its reverse (31012012221), we get a palindrome (153222222351).
The spelling of 122210210130 in words is "one hundred twenty-two billion, two hundred ten million, two hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •