Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …1011011011100000111010 |
3 | 1022110001101220121100102101 |
4 | 2101223210023123200322 |
5 | 2303010214103014320 |
6 | 33143011535254014 |
7 | 2052164303655622 |
oct | 221534413334072 |
9 | 38401356540371 |
10 | 10011102001210 |
11 | 320a7590aa932 |
12 | 115827597a30a |
13 | 5780732474cb |
14 | 26877b791882 |
15 | 12562992ec0a |
hex | 91ae42db83a |
10011102001210 has 8 divisors (see below), whose sum is σ = 18019983602196. Its totient is φ = 4004440800480.
The previous prime is 10011102001183. The next prime is 10011102001231. The reversal of 10011102001210 is 1210020111001.
It can be written as a sum of positive squares in 2 ways, for example, as 9352899179001 + 658202822209 = 3058251^2 + 811297^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: 1001110200121 = 10011102001210 / (1 + 0 + 0 + 1 + 1 + 1 + 0 + 2 + 0 + 0 + 1 + 2 + 1 + 0).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500555100051 + ... + 500555100070.
Almost surely, 210011102001210 is an apocalyptic number.
10011102001210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10011102001210 is a deficient number, since it is larger than the sum of its proper divisors (8008881600986).
10011102001210 is a wasteful number, since it uses less digits than its factorization.
10011102001210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001110200128.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10011102001210 its reverse (1210020111001), we get a palindrome (11221122112211).
The spelling of 10011102001210 in words is "ten trillion, eleven billion, one hundred two million, one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •