Base | Representation |
---|---|
bin | 10000001001110001101… |
… | …101000110110000010001 |
3 | 10221010010110011102020101 |
4 | 100021301231012300101 |
5 | 121141244324240141 |
6 | 2205533045412401 |
7 | 143124030424261 |
oct | 20116155066021 |
9 | 3833113142211 |
10 | 1110009211921 |
11 | 398830298065 |
12 | 15b163a0a101 |
13 | 8089a66c68c |
14 | 3ba209477a1 |
15 | 1dd1957d531 |
hex | 10271b46c11 |
1110009211921 has 4 divisors (see below), whose sum is σ = 1111452657700. Its totient is φ = 1108565766144.
The previous prime is 1110009211919. The next prime is 1110009211951. The reversal of 1110009211921 is 1291129000111.
It is a happy number.
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 139861040400 + 970148171521 = 373980^2 + 984961^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110009211921 - 21 = 1110009211919 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1110009211921.
It is not an unprimeable number, because it can be changed into a prime (1110009211951) 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, 721721736 + ... + 721723273.
It is an arithmetic number, because the mean of its divisors is an integer number (277863164425).
Almost surely, 21110009211921 is an apocalyptic number.
It is an amenable number.
1110009211921 is a deficient number, since it is larger than the sum of its proper divisors (1443445779).
1110009211921 is an equidigital number, since it uses as much as digits as its factorization.
1110009211921 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1443445778.
The product of its (nonzero) digits is 324, while the sum is 28.
The spelling of 1110009211921 in words is "one trillion, one hundred ten billion, nine million, two hundred eleven thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •