Base | Representation |
---|---|
bin | 1001001100011111001000… |
… | …0111000111101000000001 |
3 | 1022210111222122102212020221 |
4 | 2103013302013013220001 |
5 | 2311121011210000001 |
6 | 33300305222503041 |
7 | 2062301125036060 |
oct | 223076207075001 |
9 | 38714878385227 |
10 | 10110120000001 |
11 | 324875019598a |
12 | 11734aa894a81 |
13 | 5844c347c338 |
14 | 26d49222c1d7 |
15 | 127ec28411a1 |
hex | 931f21c7a01 |
10110120000001 has 8 divisors (see below), whose sum is σ = 11637548202560. Its totient is φ = 8603473133808.
The previous prime is 10110119999983. The next prime is 10110120000047. The reversal of 10110120000001 is 10000002101101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10110120000001 - 213 = 10110119991809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (10110120000091) 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 7 ways as a sum of consecutive naturals, for example, 5195333046 + ... + 5195334991.
It is an arithmetic number, because the mean of its divisors is an integer number (1454693525320).
Almost surely, 210110120000001 is an apocalyptic number.
It is an amenable number.
10110120000001 is a deficient number, since it is larger than the sum of its proper divisors (1527428202559).
10110120000001 is a wasteful number, since it uses less digits than its factorization.
10110120000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10390668183.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 10110120000001 its reverse (10000002101101), we get a palindrome (20110122101102).
The spelling of 10110120000001 in words is "ten trillion, one hundred ten billion, one hundred twenty million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •