Base | Representation |
---|---|
bin | 1001001100000000111101… |
… | …1100001000001100000001 |
3 | 1022202202002021211112021011 |
4 | 2103000033130020030001 |
5 | 2311002420130041001 |
6 | 33252445505000521 |
7 | 2061563345111131 |
oct | 223001734101401 |
9 | 38682067745234 |
10 | 10102022112001 |
11 | 3245275139866 |
12 | 1171a0a923141 |
13 | 583802884b31 |
14 | 26cd24962ac1 |
15 | 127b9b95bd51 |
hex | 9300f708301 |
10102022112001 has 4 divisors (see below), whose sum is σ = 10450367702100. Its totient is φ = 9753676521904.
The previous prime is 10102022111983. The next prime is 10102022112043. The reversal of 10102022112001 is 10021122020101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5909765862001 + 4192256250000 = 2431001^2 + 2047500^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102022112001 - 27 = 10102022111873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10102022112071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 174172795006 + ... + 174172795063.
It is an arithmetic number, because the mean of its divisors is an integer number (2612591925525).
Almost surely, 210102022112001 is an apocalyptic number.
It is an amenable number.
10102022112001 is a deficient number, since it is larger than the sum of its proper divisors (348345590099).
10102022112001 is an equidigital number, since it uses as much as digits as its factorization.
10102022112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348345590098.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10102022112001 its reverse (10021122020101), we get a palindrome (20123144132102).
The spelling of 10102022112001 in words is "ten trillion, one hundred two billion, twenty-two million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •