Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …0100010101101011000010 |
3 | 1100010022122221010101200121 |
4 | 2110131202210111223002 |
5 | 2314123101430133442 |
6 | 33410454302410454 |
7 | 2102041023562435 |
oct | 224354244255302 |
9 | 40108587111617 |
10 | 10202201021122 |
11 | 3283802561a40 |
12 | 1189308590a2a |
13 | 5900a9475a56 |
14 | 273b0967581c |
15 | 12a5b1736967 |
hex | 94762915ac2 |
10202201021122 has 8 divisors (see below), whose sum is σ = 16694510761872. Its totient is φ = 4637364100500.
The previous prime is 10202201021107. The next prime is 10202201021137. The reversal of 10202201021122 is 22112010220201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10202201021107) and next prime (10202201021137).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10202201021096 and 10202201021105.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 231868205004 + ... + 231868205047.
It is an arithmetic number, because the mean of its divisors is an integer number (2086813845234).
Almost surely, 210202201021122 is an apocalyptic number.
10202201021122 is a deficient number, since it is larger than the sum of its proper divisors (6492309740750).
10202201021122 is a wasteful number, since it uses less digits than its factorization.
10202201021122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 463736410064.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10202201021122 its reverse (22112010220201), we get a palindrome (32314211241323).
The spelling of 10202201021122 in words is "ten trillion, two hundred two billion, two hundred one million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •