Base | Representation |
---|---|
bin | 10000001001110001110… |
… | …000111101010110110001 |
3 | 10221010010112001201210202 |
4 | 100021301300331112301 |
5 | 121141300104101001 |
6 | 2205533123204545 |
7 | 143124042132152 |
oct | 20116160752661 |
9 | 3833115051722 |
10 | 1110010222001 |
11 | 398830917a3a |
12 | 15b164216755 |
13 | 8089a934365 |
14 | 3ba20b2b929 |
15 | 1dd196cc96b |
hex | 10271c3d5b1 |
1110010222001 has 4 divisors (see below), whose sum is σ = 1110138957312. Its totient is φ = 1109881486692.
The previous prime is 1110010221973. The next prime is 1110010222033. The reversal of 1110010222001 is 1002220100111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110010222001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1110010222051) by changing a digit.
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, 64354721 + ... + 64371966.
It is an arithmetic number, because the mean of its divisors is an integer number (277534739328).
Almost surely, 21110010222001 is an apocalyptic number.
It is an amenable number.
1110010222001 is a deficient number, since it is larger than the sum of its proper divisors (128735311).
1110010222001 is an equidigital number, since it uses as much as digits as its factorization.
1110010222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128735310.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1110010222001 its reverse (1002220100111), we get a palindrome (2112230322112).
The spelling of 1110010222001 in words is "one trillion, one hundred ten billion, ten million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •