Base | Representation |
---|---|
bin | 10000001010000011110… |
… | …000001001100111100001 |
3 | 10221010220112220122100112 |
4 | 100022003300021213201 |
5 | 121142404332444334 |
6 | 2210023103301105 |
7 | 143134365165254 |
oct | 20120360114741 |
9 | 3833815818315 |
10 | 1110311999969 |
11 | 3989761a6217 |
12 | 15b2292aa795 |
13 | 809183054c3 |
14 | 3ba4cc4509b |
15 | 1dd35e3d4ce |
hex | 10283c099e1 |
1110311999969 has 2 divisors, whose sum is σ = 1110311999970. Its totient is φ = 1110311999968.
The previous prime is 1110311999957. The next prime is 1110311999987. The reversal of 1110311999969 is 9699991130111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1022802527569 + 87509472400 = 1011337^2 + 295820^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110311999969 - 236 = 1041592523233 is a prime.
It is a super-2 number, since 2×11103119999692 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1110311999569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555155999984 + 555155999985.
It is an arithmetic number, because the mean of its divisors is an integer number (555155999985).
Almost surely, 21110311999969 is an apocalyptic number.
It is an amenable number.
1110311999969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110311999969 is an equidigital number, since it uses as much as digits as its factorization.
1110311999969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1062882, while the sum is 59.
The spelling of 1110311999969 in words is "one trillion, one hundred ten billion, three hundred eleven million, nine hundred ninety-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •