Base | Representation |
---|---|
bin | 101111110011000111100100… |
… | …001001100010111000000000 |
3 | 1000120022221011002010122121120 |
4 | 233303013210021202320000 |
5 | 210023230103003310422 |
6 | 2023034110050352240 |
7 | 62164652255035242 |
oct | 5763074411427000 |
9 | 1016287132118546 |
10 | 210221002010112 |
11 | 60a8a254203615 |
12 | 1b6b22a428b680 |
13 | 903b9a88a3292 |
14 | 39caa7222c092 |
15 | 19484e614e45c |
hex | bf31e4262e00 |
210221002010112 has 160 divisors (see below), whose sum is σ = 584607315144864. Its totient is φ = 67062081945600.
The previous prime is 210221002010039. The next prime is 210221002010113. The reversal of 210221002010112 is 211010200122012.
It is a super-2 number, since 2×2102210020101122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210221002010091 and 210221002010100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210221002010113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26852839 + ... + 33786342.
Almost surely, 2210221002010112 is an apocalyptic number.
It is an amenable number.
210221002010112 is an abundant number, since it is smaller than the sum of its proper divisors (374386313134752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210221002010112 is an equidigital number, since it uses as much as digits as its factorization.
210221002010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60639300 (or 60639284 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210221002010112 its reverse (211010200122012), we get a palindrome (421231202132124).
The spelling of 210221002010112 in words is "two hundred ten trillion, two hundred twenty-one billion, two million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •