Base | Representation |
---|---|
bin | 1001010010111000110101… |
… | …1011100010000100110101 |
3 | 1100012000212100012211200001 |
4 | 2110232031123202010311 |
5 | 2314421231100031401 |
6 | 33423014335551301 |
7 | 2103243414446443 |
oct | 224561533420465 |
9 | 40160770184601 |
10 | 10220100002101 |
11 | 3290358017300 |
12 | 119088298b531 |
13 | 59199c796a62 |
14 | 2749268c7b93 |
15 | 12acaccd8601 |
hex | 94b8d6e2135 |
10220100002101 has 12 divisors (see below), whose sum is σ = 11322117700096. Its totient is φ = 9217842507720.
The previous prime is 10220100002089. The next prime is 10220100002113. The reversal of 10220100002101 is 10120000102201.
It is an interprime number because it is at equal distance from previous prime (10220100002089) and next prime (10220100002113).
It is not a de Polignac number, because 10220100002101 - 27 = 10220100001973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220100002141) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 332518635 + ... + 332549368.
Almost surely, 210220100002101 is an apocalyptic number.
10220100002101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10220100002101 is a deficient number, since it is larger than the sum of its proper divisors (1102017697995).
10220100002101 is a wasteful number, since it uses less digits than its factorization.
10220100002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 665068152 (or 665068141 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10220100002101 its reverse (10120000102201), we get a palindrome (20340100104302).
The spelling of 10220100002101 in words is "ten trillion, two hundred twenty billion, one hundred million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •