Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …1000100010001110001101 |
3 | 1100010022200000012021120120 |
4 | 2110131202220202032031 |
5 | 2314123102220333401 |
6 | 33410454342135153 |
7 | 2102041036123404 |
oct | 224354250421615 |
9 | 40108600167516 |
10 | 10202202121101 |
11 | 3283803143411 |
12 | 1189308a214b9 |
13 | 5900a976c623 |
14 | 273b0988063b |
15 | 12a5b18a2836 |
hex | 94762a2238d |
10202202121101 has 8 divisors (see below), whose sum is σ = 13606832748384. Its totient is φ = 6799519787280.
The previous prime is 10202202121093. The next prime is 10202202121103. The reversal of 10202202121101 is 10112120220201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10202202121101 - 23 = 10202202121093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202202121103) 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 7 ways as a sum of consecutive naturals, for example, 487061146 + ... + 487082091.
It is an arithmetic number, because the mean of its divisors is an integer number (1700854093548).
Almost surely, 210202202121101 is an apocalyptic number.
It is an amenable number.
10202202121101 is a deficient number, since it is larger than the sum of its proper divisors (3404630627283).
10202202121101 is an equidigital number, since it uses as much as digits as its factorization.
10202202121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 974146731.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10202202121101 its reverse (10112120220201), we get a palindrome (20314322341302).
The spelling of 10202202121101 in words is "ten trillion, two hundred two billion, two hundred two million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •