Base | Representation |
---|---|
bin | 10001011101100110001… |
… | …011001111110111110100 |
3 | 11020201102202201020212101 |
4 | 101131212023033313310 |
5 | 124130110041201322 |
6 | 2315135501031444 |
7 | 152461240360510 |
oct | 21354613176764 |
9 | 4221382636771 |
10 | 1200010100212 |
11 | 422a15465580 |
12 | 1746a0b55584 |
13 | 89211713071 |
14 | 4211b9d7140 |
15 | 21335a33327 |
hex | 117662cfdf4 |
1200010100212 has 192 divisors, whose sum is σ = 2763072829440. Its totient is φ = 442338624000.
The previous prime is 1200010100171. The next prime is 1200010100243. The reversal of 1200010100212 is 2120010100021.
It is a super-2 number, since 2×12000101002122 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 686896723 + ... + 686898469.
It is an arithmetic number, because the mean of its divisors is an integer number (14391004320).
Almost surely, 21200010100212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1200010100212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1381536414720).
1200010100212 is an abundant number, since it is smaller than the sum of its proper divisors (1563062729228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200010100212 is a wasteful number, since it uses less digits than its factorization.
1200010100212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3302 (or 3300 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1200010100212 its reverse (2120010100021), we get a palindrome (3320020200233).
The spelling of 1200010100212 in words is "one trillion, two hundred billion, ten million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •