Base | Representation |
---|---|
bin | 11101011101010111111… |
… | …00111101110010010100 |
3 | 10120202200010000102101020 |
4 | 32232223330331302110 |
5 | 113040442230401322 |
6 | 2052555502001140 |
7 | 133062212512530 |
oct | 16565374756224 |
9 | 3522603012336 |
10 | 1012202200212 |
11 | 3602aa832585 |
12 | 1442085761b0 |
13 | 745b12a7c58 |
14 | 36dc2c5abc0 |
15 | 1b4e2b2805c |
hex | ebabf3dc94 |
1012202200212 has 48 divisors (see below), whose sum is σ = 2743455157632. Its totient is φ = 284459633280.
The previous prime is 1012202200201. The next prime is 1012202200231. The reversal of 1012202200212 is 2120022022101.
It is a super-2 number, since 2×10122022002122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012202200191 and 1012202200200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 98765583 + ... + 98775830.
It is an arithmetic number, because the mean of its divisors is an integer number (57155315784).
Almost surely, 21012202200212 is an apocalyptic number.
1012202200212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1012202200212 is an abundant number, since it is smaller than the sum of its proper divisors (1731252957420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012202200212 is a wasteful number, since it uses less digits than its factorization.
1012202200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197541488 (or 197541486 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1012202200212 its reverse (2120022022101), we get a palindrome (3132224222313).
The spelling of 1012202200212 in words is "one trillion, twelve billion, two hundred two million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •