Base | Representation |
---|---|
bin | 10001100111000101101… |
… | …010101001000111110100 |
3 | 11021200202001202111110212 |
4 | 101213011222221013310 |
5 | 124311443214201322 |
6 | 2323543103004552 |
7 | 153301636060310 |
oct | 21470552510764 |
9 | 4250661674425 |
10 | 1210202100212 |
11 | 427275598a76 |
12 | 176666299758 |
13 | 8a1771163b1 |
14 | 42807458b40 |
15 | 217306ba0e2 |
hex | 119c5aa91f4 |
1210202100212 has 96 divisors (see below), whose sum is σ = 2630590131456. Its totient is φ = 475391232000.
The previous prime is 1210202100209. The next prime is 1210202100241. The reversal of 1210202100212 is 2120012020121.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2726303 + ... + 3138969.
It is an arithmetic number, because the mean of its divisors is an integer number (27401980536).
Almost surely, 21210202100212 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 1210202100212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1315295065728).
1210202100212 is an abundant number, since it is smaller than the sum of its proper divisors (1420388031244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210202100212 is a wasteful number, since it uses less digits than its factorization.
1210202100212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 412857 (or 412855 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1210202100212 its reverse (2120012020121), we get a palindrome (3330214120333).
The spelling of 1210202100212 in words is "one trillion, two hundred ten billion, two hundred two million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •