Base | Representation |
---|---|
bin | 1100001111000011110… |
… | …1001100000010000000 |
3 | 202002120021021021200110 |
4 | 3003300331030002000 |
5 | 11420442424031422 |
6 | 240322012551320 |
7 | 21120656015643 |
oct | 3036075140200 |
9 | 662507237613 |
10 | 210201002112 |
11 | 81166a93062 |
12 | 348a3a82540 |
13 | 16a8b854aba |
14 | a260c07a5a |
15 | 5703cd860c |
hex | 30f0f4c080 |
210201002112 has 32 divisors (see below), whose sum is σ = 558346412880. Its totient is φ = 70067000576.
The previous prime is 210201002107. The next prime is 210201002117. The reversal of 210201002112 is 211200102012.
It is an interprime number because it is at equal distance from previous prime (210201002107) and next prime (210201002117).
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×2102010021122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (210201002117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 273698838 + ... + 273699605.
Almost surely, 2210201002112 is an apocalyptic number.
It is an amenable number.
210201002112 is an abundant number, since it is smaller than the sum of its proper divisors (348145410768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210201002112 is an equidigital number, since it uses as much as digits as its factorization.
210201002112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 547398460 (or 547398448 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 210201002112 its reverse (211200102012), we get a palindrome (421401104124).
The spelling of 210201002112 in words is "two hundred ten billion, two hundred one million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •