Base | Representation |
---|---|
bin | 1100010010000100101… |
… | …1010100001101101010 |
3 | 202011122122120020122000 |
4 | 3010201023110031222 |
5 | 11424122030341020 |
6 | 240534152511430 |
7 | 21150011336250 |
oct | 3044113241552 |
9 | 664578506560 |
10 | 211010012010 |
11 | 81541718186 |
12 | 34a8a9ab576 |
13 | 16b8a340995 |
14 | a2da43a5d0 |
15 | 574ed40090 |
hex | 31212d436a |
211010012010 has 128 divisors (see below), whose sum is σ = 643382231040. Its totient is φ = 48208053312.
The previous prime is 211010011991. The next prime is 211010012021. The reversal of 211010012010 is 10210010112.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 211010011983 and 211010012001.
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, 4145937 + ... + 4196523.
It is an arithmetic number, because the mean of its divisors is an integer number (5026423680).
Almost surely, 2211010012010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 211010012010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (321691115520).
211010012010 is an abundant number, since it is smaller than the sum of its proper divisors (432372219030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211010012010 is a wasteful number, since it uses less digits than its factorization.
211010012010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52817 (or 52811 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 211010012010 its reverse (10210010112), we get a palindrome (221220022122).
The spelling of 211010012010 in words is "two hundred eleven billion, ten million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •