Base | Representation |
---|---|
bin | 10000001010011001101… |
… | …010000011011001110001 |
3 | 10221011212011102121011122 |
4 | 100022121222003121301 |
5 | 121144132423003101 |
6 | 2210123352152025 |
7 | 143146446661142 |
oct | 20123152033161 |
9 | 3834764377148 |
10 | 1110679500401 |
11 | 399044693789 |
12 | 15b310398615 |
13 | 809764a8193 |
14 | 3ba85989ac9 |
15 | 1dd5833251b |
hex | 10299a83671 |
1110679500401 has 2 divisors, whose sum is σ = 1110679500402. Its totient is φ = 1110679500400.
The previous prime is 1110679500377. The next prime is 1110679500407. The reversal of 1110679500401 is 1040059760111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1065405874225 + 45273626176 = 1032185^2 + 212776^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110679500401 - 238 = 835801593457 is a prime.
It is a super-2 number, since 2×11106795004012 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1110679500407) 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, 555339750200 + 555339750201.
It is an arithmetic number, because the mean of its divisors is an integer number (555339750201).
Almost surely, 21110679500401 is an apocalyptic number.
It is an amenable number.
1110679500401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110679500401 is an equidigital number, since it uses as much as digits as its factorization.
1110679500401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 35.
The spelling of 1110679500401 in words is "one trillion, one hundred ten billion, six hundred seventy-nine million, five hundred thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •