Base | Representation |
---|---|
bin | 11001000000110110111011… |
… | …011000000110100001011100 |
3 | 112102111212101212122110121111 |
4 | 121000312323120012201130 |
5 | 103404401232044310022 |
6 | 1025545543332511404 |
7 | 32112653563626445 |
oct | 3100667330064134 |
9 | 472455355573544 |
10 | 110010141010012 |
11 | 32064047707101 |
12 | 1040885177b564 |
13 | 494cbb12608b9 |
14 | 1d2473aacc2cc |
15 | cab939b76477 |
hex | 640dbb60685c |
110010141010012 has 24 divisors (see below), whose sum is σ = 195155216395776. Its totient is φ = 54256514816448.
The previous prime is 110010141009961. The next prime is 110010141010067. The reversal of 110010141010012 is 210010141010011.
It is a super-2 number, since 2×1100101410100122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110010141009974 and 110010141010001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 625794763 + ... + 625970530.
It is an arithmetic number, because the mean of its divisors is an integer number (8131467349824).
Almost surely, 2110010141010012 is an apocalyptic number.
It is an amenable number.
110010141010012 is a deficient number, since it is larger than the sum of its proper divisors (85145075385764).
110010141010012 is a wasteful number, since it uses less digits than its factorization.
110010141010012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1251765597 (or 1251765595 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110010141010012 its reverse (210010141010011), we get a palindrome (320020282020023).
Subtracting 110010141010012 from its reverse (210010141010011), we obtain a palindrome (99999999999999).
The spelling of 110010141010012 in words is "one hundred ten trillion, ten billion, one hundred forty-one million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •