Base | Representation |
---|---|
bin | 1001010010010100000000… |
… | …0000000001100110111000 |
3 | 1100011002100011100001010101 |
4 | 2110211000000001212320 |
5 | 2314241003004323000 |
6 | 33414301200325144 |
7 | 2102443355430550 |
oct | 224450000014670 |
9 | 40132304301111 |
10 | 10210211011000 |
11 | 3287142a32990 |
12 | 118a9830137b4 |
13 | 590a84aa5c30 |
14 | 2742693c0160 |
15 | 12a8cea56e6a |
hex | 949400019b8 |
10210211011000 has 256 divisors, whose sum is σ = 32078629739520. Its totient is φ = 2937602880000.
The previous prime is 10210211010949. The next prime is 10210211011031. The reversal of 10210211011000 is 11011201201.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 4099006 + ... + 6101005.
It is an arithmetic number, because the mean of its divisors is an integer number (125307147420).
Almost surely, 210210211011000 is an apocalyptic number.
10210211011000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10210211011000 is an abundant number, since it is smaller than the sum of its proper divisors (21868418728520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210211011000 is a wasteful number, since it uses less digits than its factorization.
10210211011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10200063 (or 10200049 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10210211011000 its reverse (11011201201), we get a palindrome (10221222212201).
The spelling of 10210211011000 in words is "ten trillion, two hundred ten billion, two hundred eleven million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •