Base | Representation |
---|---|
bin | 101110010101101111011… |
… | …1010100100011001101001 |
3 | 211112212012022000200022001 |
4 | 1130223132322210121221 |
5 | 1313321432121144243 |
6 | 21313453532131001 |
7 | 1225064550626533 |
oct | 134533672443151 |
9 | 24485168020261 |
10 | 6368881428073 |
11 | 203603359110a |
12 | 86a3b9606a61 |
13 | 372776951c68 |
14 | 180381172853 |
15 | b0a08953a4d |
hex | 5cadeea4669 |
6368881428073 has 2 divisors, whose sum is σ = 6368881428074. Its totient is φ = 6368881428072.
The previous prime is 6368881427999. The next prime is 6368881428109. The reversal of 6368881428073 is 3708241888636.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3335999966784 + 3032881461289 = 1826472^2 + 1741517^2 .
It is a cyclic number.
It is not a de Polignac number, because 6368881428073 - 213 = 6368881419881 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6368881427996 and 6368881428014.
It is not a weakly prime, because it can be changed into another prime (6368881428373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3184440714036 + 3184440714037.
It is an arithmetic number, because the mean of its divisors is an integer number (3184440714037).
Almost surely, 26368881428073 is an apocalyptic number.
It is an amenable number.
6368881428073 is a deficient number, since it is larger than the sum of its proper divisors (1).
6368881428073 is an equidigital number, since it uses as much as digits as its factorization.
6368881428073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 74317824, while the sum is 64.
It can be divided in two parts, 63688 and 81428073, that added together give a triangular number (81491761 = T12766).
The spelling of 6368881428073 in words is "six trillion, three hundred sixty-eight billion, eight hundred eighty-one million, four hundred twenty-eight thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •