Base | Representation |
---|---|
bin | 11000011011000001101… |
… | …101111101011000101001 |
3 | 12221102221201122011211021 |
4 | 120123001231331120221 |
5 | 204444113021433131 |
6 | 3322554453132441 |
7 | 232152344432446 |
oct | 30330155753051 |
9 | 5842851564737 |
10 | 1678287296041 |
11 | 597837475754 |
12 | 23131b02a121 |
13 | c2353284055 |
14 | 5b32dbd49cd |
15 | 2d9c953ee11 |
hex | 186c1b7d629 |
1678287296041 has 8 divisors (see below), whose sum is σ = 1687617508104. Its totient is φ = 1668965276160.
The previous prime is 1678287296029. The next prime is 1678287296051. The reversal of 1678287296041 is 1406927828761.
It can be written as a sum of positive squares in 4 ways, for example, as 1202871530025 + 475415766016 = 1096755^2 + 689504^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1678287296041 - 27 = 1678287295913 is a prime.
It is a super-2 number, since 2×16782872960412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1678287296051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1636950 + ... + 2456863.
It is an arithmetic number, because the mean of its divisors is an integer number (210952188513).
Almost surely, 21678287296041 is an apocalyptic number.
It is an amenable number.
1678287296041 is a deficient number, since it is larger than the sum of its proper divisors (9330212063).
1678287296041 is a wasteful number, since it uses less digits than its factorization.
1678287296041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4096091.
The product of its (nonzero) digits is 16257024, while the sum is 61.
The spelling of 1678287296041 in words is "one trillion, six hundred seventy-eight billion, two hundred eighty-seven million, two hundred ninety-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •