Base | Representation |
---|---|
bin | 1001000110101010111001… |
… | …1111001001110111000000 |
3 | 1022102222002010121000100211 |
4 | 2101222232133021313000 |
5 | 2303001343001431422 |
6 | 33142342320123504 |
7 | 2052133055211316 |
oct | 221525637116700 |
9 | 38388063530324 |
10 | 10010201202112 |
11 | 320a336682171 |
12 | 1158064166594 |
13 | 577c5b7311a7 |
14 | 2686d3ca80b6 |
15 | 1255c57e6577 |
hex | 91aae7c9dc0 |
10010201202112 has 56 divisors (see below), whose sum is σ = 21419453417040. Its totient is φ = 4626023639040.
The previous prime is 10010201202109. The next prime is 10010201202121. The reversal of 10010201202112 is 21120210201001.
10010201202112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10010201202092 and 10010201202101.
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, 100341283 + ... + 100440994.
It is an arithmetic number, because the mean of its divisors is an integer number (382490239590).
Almost surely, 210010201202112 is an apocalyptic number.
It is an amenable number.
10010201202112 is an abundant number, since it is smaller than the sum of its proper divisors (11409252214928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010201202112 is a wasteful number, since it uses less digits than its factorization.
10010201202112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200782349 (or 200782339 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10010201202112 its reverse (21120210201001), we get a palindrome (31130411403113).
The spelling of 10010201202112 in words is "ten trillion, ten billion, two hundred one million, two hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •