Base | Representation |
---|---|
bin | 1101000000001111000010… |
… | …01001010111010000010001 |
3 | 10202020200122211020012012122 |
4 | 12200013201021113100101 |
5 | 12222001311400230432 |
6 | 140452311142304025 |
7 | 6010643016546263 |
oct | 640074111272021 |
9 | 122220584205178 |
10 | 28595374617617 |
11 | 91252595455a5 |
12 | 3259b85128015 |
13 | 12c56bc49bb32 |
14 | 70c048757b33 |
15 | 348c70a60612 |
hex | 1a01e1257411 |
28595374617617 has 2 divisors, whose sum is σ = 28595374617618. Its totient is φ = 28595374617616.
The previous prime is 28595374617529. The next prime is 28595374617619. The reversal of 28595374617617 is 71671647359582.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28314754387921 + 280620229696 = 5321161^2 + 529736^2 .
It is a cyclic number.
It is not a de Polignac number, because 28595374617617 - 218 = 28595374355473 is a prime.
Together with 28595374617619, 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 (28595374617619) 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, 14297687308808 + 14297687308809.
It is an arithmetic number, because the mean of its divisors is an integer number (14297687308809).
Almost surely, 228595374617617 is an apocalyptic number.
It is an amenable number.
28595374617617 is a deficient number, since it is larger than the sum of its proper divisors (1).
28595374617617 is an equidigital number, since it uses as much as digits as its factorization.
28595374617617 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 533433600, while the sum is 71.
The spelling of 28595374617617 in words is "twenty-eight trillion, five hundred ninety-five billion, three hundred seventy-four million, six hundred seventeen thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •