Base | Representation |
---|---|
bin | 1001010001110101011101… |
… | …0011010100111001001110 |
3 | 1100010022011202110202001211 |
4 | 2110131113103110321032 |
5 | 2314122210033341420 |
6 | 33410423431325034 |
7 | 2102033240202652 |
oct | 224352723247116 |
9 | 40108152422054 |
10 | 10202012012110 |
11 | 32837158a6746 |
12 | 118927522077a |
13 | 5900792693b9 |
14 | 273acc514a62 |
15 | 12a59ed4de5a |
hex | 947574d4e4e |
10202012012110 has 32 divisors (see below), whose sum is σ = 18492522429600. Its totient is φ = 4052193754752.
The previous prime is 10202012012107. The next prime is 10202012012113. The reversal of 10202012012110 is 1121021020201.
It is an interprime number because it is at equal distance from previous prime (10202012012107) and next prime (10202012012113).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202012012113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 334417 + ... + 4529443.
It is an arithmetic number, because the mean of its divisors is an integer number (577891325925).
Almost surely, 210202012012110 is an apocalyptic number.
10202012012110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10202012012110 is a deficient number, since it is larger than the sum of its proper divisors (8290510417490).
10202012012110 is a wasteful number, since it uses less digits than its factorization.
10202012012110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4196740.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10202012012110 its reverse (1121021020201), we get a palindrome (11323033032311).
The spelling of 10202012012110 in words is "ten trillion, two hundred two billion, twelve million, twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •