Base | Representation |
---|---|
bin | 100010000111001110000… |
… | …0110100101101111010101 |
3 | 121121012122121222110222012 |
4 | 1010032130012211233111 |
5 | 1103303400120334302 |
6 | 13545500105314005 |
7 | 662504423643554 |
oct | 104163406455725 |
9 | 17535577873865 |
10 | 4688428293077 |
11 | 15483955a9611 |
12 | 638795195905 |
13 | 280169a6a4c9 |
14 | 122cc7873d9b |
15 | 81e541e3a52 |
hex | 4439c1a5bd5 |
4688428293077 has 2 divisors, whose sum is σ = 4688428293078. Its totient is φ = 4688428293076.
The previous prime is 4688428293053. The next prime is 4688428293083. The reversal of 4688428293077 is 7703928248864.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4688324884516 + 103408561 = 2165254^2 + 10169^2 .
It is a cyclic number.
It is not a de Polignac number, because 4688428293077 - 218 = 4688428030933 is a prime.
It is a super-2 number, since 2×46884282930772 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4688428292998 and 4688428293016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4688428293097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2344214146538 + 2344214146539.
It is an arithmetic number, because the mean of its divisors is an integer number (2344214146539).
Almost surely, 24688428293077 is an apocalyptic number.
It is an amenable number.
4688428293077 is a deficient number, since it is larger than the sum of its proper divisors (1).
4688428293077 is an equidigital number, since it uses as much as digits as its factorization.
4688428293077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 260112384, while the sum is 68.
The spelling of 4688428293077 in words is "four trillion, six hundred eighty-eight billion, four hundred twenty-eight million, two hundred ninety-three thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •