Base | Representation |
---|---|
bin | 1001010010010100000000… |
… | …0000110000001111010000 |
3 | 1100011002100011200202010110 |
4 | 2110211000000300033100 |
5 | 2314241003031431000 |
6 | 33414301204401320 |
7 | 2102443360154445 |
oct | 224450000601720 |
9 | 40132304622113 |
10 | 10210211202000 |
11 | 3287143053437 |
12 | 118a9830a6240 |
13 | 590a84b41b54 |
14 | 27426942d9cc |
15 | 12a8cea93850 |
hex | 949400303d0 |
10210211202000 has 160 divisors (see below), whose sum is σ = 32919517373184. Its totient is φ = 2722574400000.
The previous prime is 10210211201999. The next prime is 10210211202007. The reversal of 10210211202000 is 20211201201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210211202007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 150668125 + ... + 150735875.
Almost surely, 210210211202000 is an apocalyptic number.
10210211202000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10210211202000 is an abundant number, since it is smaller than the sum of its proper divisors (22709306171184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210211202000 is a wasteful number, since it uses less digits than its factorization.
10210211202000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92894 (or 92878 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10210211202000 its reverse (20211201201), we get a palindrome (10230422403201).
The spelling of 10210211202000 in words is "ten trillion, two hundred ten billion, two hundred eleven million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.642 sec. • engine limits •