Base | Representation |
---|---|
bin | 11001000000101111011101… |
… | …011010011000110100101100 |
3 | 112102111002201000122122001211 |
4 | 121000233131122120310230 |
5 | 103404233321224200022 |
6 | 1025542135515444204 |
7 | 32112251063210212 |
oct | 3100573532306454 |
9 | 472432630578054 |
10 | 110002122100012 |
11 | 320607021a335a |
12 | 10407194156664 |
13 | 494c203b2953c |
14 | 1d241b9b00cb2 |
15 | cab61ab92e77 |
hex | 640bdd698d2c |
110002122100012 has 12 divisors (see below), whose sum is σ = 192514785500520. Its totient is φ = 54997897671296.
The previous prime is 110002122100007. The next prime is 110002122100049. The reversal of 110002122100012 is 210001221200011.
It is a junction number, because it is equal to n+sod(n) for n = 110002122099965 and 110002122100001.
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, 790766437 + ... + 790905532.
It is an arithmetic number, because the mean of its divisors is an integer number (16042898791710).
Almost surely, 2110002122100012 is an apocalyptic number.
It is an amenable number.
110002122100012 is a deficient number, since it is larger than the sum of its proper divisors (82512663400508).
110002122100012 is a wasteful number, since it uses less digits than its factorization.
110002122100012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1581689360 (or 1581689358 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110002122100012 its reverse (210001221200011), we get a palindrome (320003343300023).
Subtracting 110002122100012 from its reverse (210001221200011), we obtain a palindrome (99999099099999).
The spelling of 110002122100012 in words is "one hundred ten trillion, two billion, one hundred twenty-two million, one hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •