Base | Representation |
---|---|
bin | 11001000000101111010110… |
… | …101110110011001001100100 |
3 | 112102111002102012201212202202 |
4 | 121000233112232303021210 |
5 | 103404233104030311322 |
6 | 1025542120433154032 |
7 | 32112245232362615 |
oct | 3100572656631144 |
9 | 472432365655682 |
10 | 110002010010212 |
11 | 320606549a4661 |
12 | 104071626bb918 |
13 | 494c1b6841c08 |
14 | 1d241a8c83c0c |
15 | cab610e01292 |
hex | 640bd6bb3264 |
110002010010212 has 6 divisors (see below), whose sum is σ = 192503517517878. Its totient is φ = 55001005005104.
The previous prime is 110002010010143. The next prime is 110002010010239. The reversal of 110002010010212 is 212010010200011.
It can be written as a sum of positive squares in only one way, i.e., 103775457976576 + 6226552033636 = 10187024^2 + 2495306^2 .
It is a junction number, because it is equal to n+sod(n) for n = 110002010010193 and 110002010010202.
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 as a sum of consecutive naturals, namely, 13750251251273 + ... + 13750251251280.
It is an arithmetic number, because the mean of its divisors is an integer number (32083919586313).
Almost surely, 2110002010010212 is an apocalyptic number.
It is an amenable number.
110002010010212 is a deficient number, since it is larger than the sum of its proper divisors (82501507507666).
110002010010212 is a wasteful number, since it uses less digits than its factorization.
110002010010212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27500502502557 (or 27500502502555 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110002010010212 its reverse (212010010200011), we get a palindrome (322012020210223).
The spelling of 110002010010212 in words is "one hundred ten trillion, two billion, ten million, ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •