Base | Representation |
---|---|
bin | 11001000000101111011101… |
… | …011010011000110100101011 |
3 | 112102111002201000122122001210 |
4 | 121000233131122120310223 |
5 | 103404233321224200021 |
6 | 1025542135515444203 |
7 | 32112251063210211 |
oct | 3100573532306453 |
9 | 472432630578053 |
10 | 110002122100011 |
11 | 320607021a3359 |
12 | 10407194156663 |
13 | 494c203b2953b |
14 | 1d241b9b00cb1 |
15 | cab61ab92e76 |
hex | 640bdd698d2b |
110002122100011 has 8 divisors (see below), whose sum is σ = 147653855168400. Its totient is φ = 72842568549152.
The previous prime is 110002122100007. The next prime is 110002122100049. The reversal of 110002122100011 is 110001221200011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110002122100011 - 22 = 110002122100007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110002122100011.
It is not an unprimeable number, because it can be changed into a prime (110002122105011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 123044878860 + ... + 123044879753.
It is an arithmetic number, because the mean of its divisors is an integer number (18456731896050).
Almost surely, 2110002122100011 is an apocalyptic number.
110002122100011 is a deficient number, since it is larger than the sum of its proper divisors (37651733068389).
110002122100011 is a wasteful number, since it uses less digits than its factorization.
110002122100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 246089758765.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110002122100011 its reverse (110001221200011), we get a palindrome (220003343300022).
The spelling of 110002122100011 in words is "one hundred ten trillion, two billion, one hundred twenty-two million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •