Base | Representation |
---|---|
bin | 110110100100110001… |
… | …100001111110010001 |
3 | 12121020212101202212222 |
4 | 312210301201332101 |
5 | 1430002322204411 |
6 | 42530420230425 |
7 | 4143065321066 |
oct | 664461417621 |
9 | 177225352788 |
10 | 58599022481 |
11 | 229406909aa |
12 | b43483b415 |
13 | 56ab4287cc |
14 | 2b9c7a8c6d |
15 | 17ce7684db |
hex | da4c61f91 |
58599022481 has 2 divisors, whose sum is σ = 58599022482. Its totient is φ = 58599022480.
The previous prime is 58599022459. The next prime is 58599022483. The reversal of 58599022481 is 18422099585.
It is a happy number.
58599022481 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30310810000 + 28288212481 = 174100^2 + 168191^2 .
It is a cyclic number.
It is not a de Polignac number, because 58599022481 - 214 = 58599006097 is a prime.
It is a super-2 number, since 2×585990224812 (a number of 22 digits) contains 22 as substring.
Together with 58599022483, 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 (58599022483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 29299511240 + 29299511241.
It is an arithmetic number, because the mean of its divisors is an integer number (29299511241).
Almost surely, 258599022481 is an apocalyptic number.
It is an amenable number.
58599022481 is a deficient number, since it is larger than the sum of its proper divisors (1).
58599022481 is an equidigital number, since it uses as much as digits as its factorization.
58599022481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2073600, while the sum is 53.
The spelling of 58599022481 in words is "fifty-eight billion, five hundred ninety-nine million, twenty-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •