Base | Representation |
---|---|
bin | 1001010010010011101010… |
… | …1000101010010100010011 |
3 | 1100011002002212222000112110 |
4 | 2110210322220222110103 |
5 | 2314240311434001321 |
6 | 33414244223200403 |
7 | 2102441213361456 |
oct | 224447250522423 |
9 | 40132085860473 |
10 | 10210121000211 |
11 | 32870a7144500 |
12 | 118a958a46103 |
13 | 590a6c24c102 |
14 | 27425b46d49d |
15 | 12a8c6bc7176 |
hex | 9493aa2a513 |
10210121000211 has 96 divisors (see below), whose sum is σ = 15705265121280. Its totient is φ = 5884468128000.
The previous prime is 10210121000207. The next prime is 10210121000213. The reversal of 10210121000211 is 11200012101201.
It is not a de Polignac number, because 10210121000211 - 22 = 10210121000207 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10210121000213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1318962801 + ... + 1318970541.
It is an arithmetic number, because the mean of its divisors is an integer number (163596511680).
Almost surely, 210210121000211 is an apocalyptic number.
10210121000211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10210121000211 is a deficient number, since it is larger than the sum of its proper divisors (5495144121069).
10210121000211 is a wasteful number, since it uses less digits than its factorization.
10210121000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8689 (or 8678 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10210121000211 its reverse (11200012101201), we get a palindrome (21410133101412).
The spelling of 10210121000211 in words is "ten trillion, two hundred ten billion, one hundred twenty-one million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •