Base | Representation |
---|---|
bin | 1001000110101010111100… |
… | …1000110000111100100000 |
3 | 1022102222002220010012022211 |
4 | 2101222233020300330200 |
5 | 2303001403300010422 |
6 | 33142343350011504 |
7 | 2052133250012134 |
oct | 221525710607440 |
9 | 38388086105284 |
10 | 10010212110112 |
11 | 320a341852545 |
12 | 1158067946b94 |
13 | 577c60a80126 |
14 | 2686d55073c4 |
15 | 1255c674d577 |
hex | 91aaf230f20 |
10010212110112 has 48 divisors (see below), whose sum is σ = 19793977213752. Its totient is φ = 4983198105600.
The previous prime is 10010212110103. The next prime is 10010212110161. The reversal of 10010212110112 is 21101121201001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3214576469776 + 6795635640336 = 1792924^2 + 2606844^2 .
It is a super-2 number, since 2×100102121101122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10010212110092 and 10010212110101.
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, 11098048 + ... + 11966080.
Almost surely, 210010212110112 is an apocalyptic number.
It is an amenable number.
10010212110112 is a deficient number, since it is larger than the sum of its proper divisors (9783765103640).
10010212110112 is a wasteful number, since it uses less digits than its factorization.
10010212110112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 869621 (or 869613 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10010212110112 its reverse (21101121201001), we get a palindrome (31111333311113).
The spelling of 10010212110112 in words is "ten trillion, ten billion, two hundred twelve million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •