Base | Representation |
---|---|
bin | 1001001101000100110000… |
… | …0111111110110010111010 |
3 | 1022211111001112120121111102 |
4 | 2103101030013332302322 |
5 | 2311302202322010020 |
6 | 33305055343131402 |
7 | 2063106326411663 |
oct | 223211407766272 |
9 | 38744045517442 |
10 | 10120220110010 |
11 | 3251a6346703a |
12 | 11754492a3b62 |
13 | 585442b1b3aa |
14 | 26db6d7b036a |
15 | 1283b43c6475 |
hex | 9344c1fecba |
10120220110010 has 8 divisors (see below), whose sum is σ = 18216396198036. Its totient is φ = 4048088044000.
The previous prime is 10120220110003. The next prime is 10120220110061. The reversal of 10120220110010 is 1001102202101.
It can be written as a sum of positive squares in 2 ways, for example, as 9709150634401 + 411069475609 = 3115951^2 + 641147^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10120220109973 and 10120220110000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 506011005491 + ... + 506011005510.
Almost surely, 210120220110010 is an apocalyptic number.
10120220110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10120220110010 is a deficient number, since it is larger than the sum of its proper divisors (8096176088026).
10120220110010 is a wasteful number, since it uses less digits than its factorization.
10120220110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1012022011008.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10120220110010 its reverse (1001102202101), we get a palindrome (11121322312111).
The spelling of 10120220110010 in words is "ten trillion, one hundred twenty billion, two hundred twenty million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •