Base | Representation |
---|---|
bin | 1001001100000000111010… |
… | …1110010110000001000110 |
3 | 1022202202001110020202122102 |
4 | 2103000032232112001012 |
5 | 2311002404042010042 |
6 | 33252444355432102 |
7 | 2061563141103005 |
oct | 223001656260106 |
9 | 38682043222572 |
10 | 10102010110022 |
11 | 3245269391576 |
12 | 1171a068b5632 |
13 | 583800241c7c |
14 | 26cd2311ac3c |
15 | 127b9a88ab32 |
hex | 9300eb96046 |
10102010110022 has 4 divisors (see below), whose sum is σ = 15153015165036. Its totient is φ = 5051005055010.
The previous prime is 10102010110021. The next prime is 10102010110067. The reversal of 10102010110022 is 22001101020101.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 10102010109985 and 10102010110012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102010110021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525502527504 + ... + 2525502527507.
It is an arithmetic number, because the mean of its divisors is an integer number (3788253791259).
Almost surely, 210102010110022 is an apocalyptic number.
10102010110022 is a deficient number, since it is larger than the sum of its proper divisors (5051005055014).
10102010110022 is an equidigital number, since it uses as much as digits as its factorization.
10102010110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5051005055013.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10102010110022 its reverse (22001101020101), we get a palindrome (32103111130123).
The spelling of 10102010110022 in words is "ten trillion, one hundred two billion, ten million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •