Base | Representation |
---|---|
bin | 10010110110101000… |
… | …10111101100111010 |
3 | 222010102022221022201 |
4 | 21123110113230322 |
5 | 131212213014320 |
6 | 4352221340414 |
7 | 505555406416 |
oct | 113324275472 |
9 | 28112287281 |
10 | 10122001210 |
11 | 4324673362 |
12 | 1b65a0770a |
13 | c54065239 |
14 | 6c043dd46 |
15 | 3e395b70a |
hex | 25b517b3a |
10122001210 has 8 divisors (see below), whose sum is σ = 18219602196. Its totient is φ = 4048800480.
The previous prime is 10122001189. The next prime is 10122001217. The reversal of 10122001210 is 1210022101.
It can be written as a sum of positive squares in 2 ways, for example, as 10068316281 + 53684929 = 100341^2 + 7327^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 1012200121 = 10122001210 / (1 + 0 + 1 + 2 + 2 + 0 + 0 + 1 + 2 + 1 + 0).
It is not an unprimeable number, because it can be changed into a prime (10122001217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 506100051 + ... + 506100070.
Almost surely, 210122001210 is an apocalyptic number.
10122001210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10122001210 is a deficient number, since it is larger than the sum of its proper divisors (8097600986).
10122001210 is a wasteful number, since it uses less digits than its factorization.
10122001210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1012200128.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10122001210 its reverse (1210022101), we get a palindrome (11332023311).
The spelling of 10122001210 in words is "ten billion, one hundred twenty-two million, one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •