Base | Representation |
---|---|
bin | 1001001101101001010001… |
… | …0111111111101011111110 |
3 | 1022212102100122221111000120 |
4 | 2103122110113333223332 |
5 | 2311432241140431420 |
6 | 33313400140035410 |
7 | 2063604252001656 |
oct | 223322427775376 |
9 | 38772318844016 |
10 | 10130022202110 |
11 | 32561334979a8 |
12 | 1177323b32b66 |
13 | 5863458048a5 |
14 | 27041d537366 |
15 | 128789bded40 |
hex | 936945ffafe |
10130022202110 has 16 divisors (see below), whose sum is σ = 24312053285136. Its totient is φ = 2701339253888.
The previous prime is 10130022202103. The next prime is 10130022202129. The reversal of 10130022202110 is 1120222003101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10130022202110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 168833703339 + ... + 168833703398.
It is an arithmetic number, because the mean of its divisors is an integer number (1519503330321).
Almost surely, 210130022202110 is an apocalyptic number.
10130022202110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10130022202110 is an abundant number, since it is smaller than the sum of its proper divisors (14182031083026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10130022202110 is a wasteful number, since it uses less digits than its factorization.
10130022202110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 337667406747.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10130022202110 its reverse (1120222003101), we get a palindrome (11250244205211).
The spelling of 10130022202110 in words is "ten trillion, one hundred thirty billion, twenty-two million, two hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •