Base | Representation |
---|---|
bin | 1100001110010011111… |
… | …0110100001001111100 |
3 | 202002001021020111120000 |
4 | 3003210332310021330 |
5 | 11420040011231022 |
6 | 240250034554300 |
7 | 21112666262241 |
oct | 3034476641174 |
9 | 662037214500 |
10 | 210000102012 |
11 | 81073645918 |
12 | 34848738990 |
13 | 16a59043bbc |
14 | a24226d5c8 |
15 | 56e13526ac |
hex | 30e4fb427c |
210000102012 has 240 divisors, whose sum is σ = 604564884000. Its totient is φ = 63304851456.
The previous prime is 210000102001. The next prime is 210000102049. The reversal of 210000102012 is 210201000012.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 210000101985 and 210000102003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 15882028 + ... + 15895244.
It is an arithmetic number, because the mean of its divisors is an integer number (2519020350).
Almost surely, 2210000102012 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 210000102012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (302282442000).
210000102012 is an abundant number, since it is smaller than the sum of its proper divisors (394564781988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210000102012 is a wasteful number, since it uses less digits than its factorization.
210000102012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13370 (or 13359 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 210000102012 its reverse (210201000012), we get a palindrome (420201102024).
The spelling of 210000102012 in words is "two hundred ten billion, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •