Base | Representation |
---|---|
bin | 1001000110101110010101… |
… | …0000000101110000000001 |
3 | 1022110001110011110210010021 |
4 | 2101223211100011300001 |
5 | 2303010233210000001 |
6 | 33143013421133441 |
7 | 2052164612651341 |
oct | 221534520056001 |
9 | 38401404423107 |
10 | 10011120000001 |
11 | 320a76828366a |
12 | 115827b9ba281 |
13 | 578076ba9a93 |
14 | 26877dd18d21 |
15 | 12562b2d7ba1 |
hex | 91ae5405c01 |
10011120000001 has 4 divisors (see below), whose sum is σ = 10148258630212. Its totient is φ = 9873981369792.
The previous prime is 10011119999999. The next prime is 10011120000053. The reversal of 10011120000001 is 10000002111001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2774756377600 + 7236363622401 = 1665760^2 + 2690049^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011120000001 - 21 = 10011119999999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10011120060001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 68569314996 + ... + 68569315141.
It is an arithmetic number, because the mean of its divisors is an integer number (2537064657553).
Almost surely, 210011120000001 is an apocalyptic number.
It is an amenable number.
10011120000001 is a deficient number, since it is larger than the sum of its proper divisors (137138630211).
10011120000001 is an equidigital number, since it uses as much as digits as its factorization.
10011120000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137138630210.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 10011120000001 its reverse (10000002111001), we get a palindrome (20011122111002).
The spelling of 10011120000001 in words is "ten trillion, eleven billion, one hundred twenty million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •