Base | Representation |
---|---|
bin | 1001010001110110001111… |
… | …0000101000011110101101 |
3 | 1100010022201022202111111120 |
4 | 2110131203300220132231 |
5 | 2314123122040133401 |
6 | 33410500255211153 |
7 | 2102041355561424 |
oct | 224354360503655 |
9 | 40108638674446 |
10 | 10202221021101 |
11 | 328381288224a |
12 | 1189313216ab9 |
13 | 5900b0659165 |
14 | 273b0c1a02bb |
15 | 12a5b3387836 |
hex | 94763c287ad |
10202221021101 has 8 divisors (see below), whose sum is σ = 13970608965984. Its totient is φ = 6617656878480.
The previous prime is 10202221021093. The next prime is 10202221021123. The reversal of 10202221021101 is 10112012220201.
10202221021101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10202221021101 - 23 = 10202221021093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202221021171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45955950435 + ... + 45955950656.
It is an arithmetic number, because the mean of its divisors is an integer number (1746326120748).
Almost surely, 210202221021101 is an apocalyptic number.
It is an amenable number.
10202221021101 is a deficient number, since it is larger than the sum of its proper divisors (3768387944883).
10202221021101 is an equidigital number, since it uses as much as digits as its factorization.
10202221021101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91911901131.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10202221021101 its reverse (10112012220201), we get a palindrome (20314233241302).
The spelling of 10202221021101 in words is "ten trillion, two hundred two billion, two hundred twenty-one million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •