Base | Representation |
---|---|
bin | 11101011101000010001… |
… | …10110001000100110100 |
3 | 10120202012102120212202020 |
4 | 32232201012301010310 |
5 | 113040104134021322 |
6 | 2052525441313140 |
7 | 133054542636561 |
oct | 16564106610464 |
9 | 3522172525666 |
10 | 1012020220212 |
11 | 360217038291 |
12 | 1441776357b0 |
13 | 7458268ca91 |
14 | 36da6a09868 |
15 | 1b4d1b7d05c |
hex | eba11b1134 |
1012020220212 has 48 divisors (see below), whose sum is σ = 2374521448320. Its totient is φ = 335464132608.
The previous prime is 1012020220199. The next prime is 1012020220229. The reversal of 1012020220212 is 2120220202101.
It is a super-2 number, since 2×10120202202122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012020220191 and 1012020220200.
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, 6085464 + ... + 6249552.
It is an arithmetic number, because the mean of its divisors is an integer number (49469196840).
Almost surely, 21012020220212 is an apocalyptic number.
1012020220212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1012020220212 is an abundant number, since it is smaller than the sum of its proper divisors (1362501228108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012020220212 is a wasteful number, since it uses less digits than its factorization.
1012020220212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166952 (or 166950 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1012020220212 its reverse (2120220202101), we get a palindrome (3132240422313).
The spelling of 1012020220212 in words is "one trillion, twelve billion, twenty million, two hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •