Base | Representation |
---|---|
bin | 11010100101100010001101… |
… | …10111110010000011100011 |
3 | 21200000010112110112112120211 |
4 | 31102301012313302003203 |
5 | 30130334323132024334 |
6 | 324202042103514551 |
7 | 15212622312224365 |
oct | 1522610667620343 |
9 | 250003473475524 |
10 | 58464283861219 |
11 | 176a0622096055 |
12 | 668292a458a57 |
13 | 2681209a71072 |
14 | 1061987824d35 |
15 | 6b5bcbd68a64 |
hex | 352c46df20e3 |
58464283861219 has 2 divisors, whose sum is σ = 58464283861220. Its totient is φ = 58464283861218.
The previous prime is 58464283861183. The next prime is 58464283861253. The reversal of 58464283861219 is 91216838246485.
58464283861219 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 is a cyclic number.
It is not a de Polignac number, because 58464283861219 - 211 = 58464283859171 is a prime.
It is a super-2 number, since 2×584642838612192 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (58464283861289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 29232141930609 + 29232141930610.
It is an arithmetic number, because the mean of its divisors is an integer number (29232141930610).
Almost surely, 258464283861219 is an apocalyptic number.
58464283861219 is a deficient number, since it is larger than the sum of its proper divisors (1).
58464283861219 is an equidigital number, since it uses as much as digits as its factorization.
58464283861219 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 159252480, while the sum is 67.
The spelling of 58464283861219 in words is "fifty-eight trillion, four hundred sixty-four billion, two hundred eighty-three million, eight hundred sixty-one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •