Base | Representation |
---|---|
bin | 110110011101100101… |
… | …000000000101110101 |
3 | 12120221110020022021221 |
4 | 312131211000011311 |
5 | 1424230421004321 |
6 | 42510424510341 |
7 | 4140101220103 |
oct | 663545000565 |
9 | 176843208257 |
10 | 58478297461 |
11 | 22889524461 |
12 | b40031b3b1 |
13 | 568c40989c |
14 | 2b8a740c73 |
15 | 17c3d6ce41 |
hex | d9d940175 |
58478297461 has 2 divisors, whose sum is σ = 58478297462. Its totient is φ = 58478297460.
The previous prime is 58478297447. The next prime is 58478297509. The reversal of 58478297461 is 16479287485.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33344951236 + 25133346225 = 182606^2 + 158535^2 .
It is a cyclic number.
It is not a de Polignac number, because 58478297461 - 227 = 58344079733 is a prime.
It is a super-2 number, since 2×584782974612 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 58478297461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (58478297411) 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, 29239148730 + 29239148731.
It is an arithmetic number, because the mean of its divisors is an integer number (29239148731).
Almost surely, 258478297461 is an apocalyptic number.
It is an amenable number.
58478297461 is a deficient number, since it is larger than the sum of its proper divisors (1).
58478297461 is an equidigital number, since it uses as much as digits as its factorization.
58478297461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27095040, while the sum is 61.
The spelling of 58478297461 in words is "fifty-eight billion, four hundred seventy-eight million, two hundred ninety-seven thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •