Base | Representation |
---|---|
bin | 111000110100001100… |
… | …0000000111100110100 |
3 | 102122221002201212100101 |
4 | 1301220120000330310 |
5 | 3444334103210400 |
6 | 132014542123444 |
7 | 11546345450152 |
oct | 1615030007464 |
9 | 378832655311 |
10 | 122010210100 |
11 | 47820645789 |
12 | 1b790b80584 |
13 | b6757c7abc |
14 | 5c962dc3d2 |
15 | 32916d356a |
hex | 1c68600f34 |
122010210100 has 36 divisors (see below), whose sum is σ = 264837736800. Its totient is φ = 48790152160.
The previous prime is 122010210083. The next prime is 122010210107. The reversal of 122010210100 is 1012010221.
It is a super-2 number, since 2×1220102101002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122010210107) 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, 181521 + ... + 526279.
It is an arithmetic number, because the mean of its divisors is an integer number (7356603800).
Almost surely, 2122010210100 is an apocalyptic number.
122010210100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122010210100 is an abundant number, since it is smaller than the sum of its proper divisors (142827526700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122010210100 is a wasteful number, since it uses less digits than its factorization.
122010210100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348312 (or 348305 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 122010210100 its reverse (1012010221), we get a palindrome (123022220321).
The spelling of 122010210100 in words is "one hundred twenty-two billion, ten million, two hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •