Base | Representation |
---|---|
bin | 11111000110001000000… |
… | …11111101111110010001 |
3 | 10210010211111201212120022 |
4 | 33203010003331332101 |
5 | 120001131430422032 |
6 | 2134500220153225 |
7 | 140122653616631 |
oct | 17430403757621 |
9 | 3703744655508 |
10 | 1068441264017 |
11 | 38213a26a606 |
12 | 1530a2998815 |
13 | 799a47c73ba |
14 | 399da02a6c1 |
15 | 1cbd50c9512 |
hex | f8c40fdf91 |
1068441264017 has 2 divisors, whose sum is σ = 1068441264018. Its totient is φ = 1068441264016.
The previous prime is 1068441263999. The next prime is 1068441264019. The reversal of 1068441264017 is 7104621448601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 581008293121 + 487432970896 = 762239^2 + 698164^2 .
It is an emirp because it is prime and its reverse (7104621448601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1068441264017 - 214 = 1068441247633 is a prime.
It is a super-2 number, since 2×10684412640172 (a number of 25 digits) contains 22 as substring.
Together with 1068441264019, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1068441264019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 534220632008 + 534220632009.
It is an arithmetic number, because the mean of its divisors is an integer number (534220632009).
Almost surely, 21068441264017 is an apocalyptic number.
It is an amenable number.
1068441264017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1068441264017 is an equidigital number, since it uses as much as digits as its factorization.
1068441264017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 258048, while the sum is 44.
The spelling of 1068441264017 in words is "one trillion, sixty-eight billion, four hundred forty-one million, two hundred sixty-four thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •