Base | Representation |
---|---|
bin | 11001000011110011000001… |
… | …001000011001100101100010 |
3 | 112110020011200211000222100111 |
4 | 121003303001020121211202 |
5 | 103421203340330120002 |
6 | 1030222423520441534 |
7 | 32133363414451342 |
oct | 3103630110314542 |
9 | 473204624028314 |
10 | 110212101020002 |
11 | 32131764890873 |
12 | 1043ba157792aa |
13 | 4965c58664ca7 |
14 | 1d30419218d22 |
15 | cb1d0a20e3d7 |
hex | 643cc1219962 |
110212101020002 has 16 divisors (see below), whose sum is σ = 166625913380472. Its totient is φ = 54671204914560.
The previous prime is 110212101019997. The next prime is 110212101020083. The reversal of 110212101020002 is 200020101212011.
It can be written as a sum of positive squares in 4 ways, for example, as 65634966574681 + 44577134445321 = 8101541^2 + 6676611^2 .
It is a super-2 number, since 2×1102121010200022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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, 268549899 + ... + 268959982.
Almost surely, 2110212101020002 is an apocalyptic number.
110212101020002 is a deficient number, since it is larger than the sum of its proper divisors (56413812360470).
110212101020002 is a wasteful number, since it uses less digits than its factorization.
110212101020002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537510693.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110212101020002 its reverse (200020101212011), we get a palindrome (310232202232013).
The spelling of 110212101020002 in words is "one hundred ten trillion, two hundred twelve billion, one hundred one million, twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •