Base | Representation |
---|---|
bin | 101101001011100111… |
… | …001101000101001011 |
3 | 11122012222011100022121 |
4 | 231023213031011023 |
5 | 1243323340134101 |
6 | 34141530232111 |
7 | 3335126320045 |
oct | 551347150513 |
9 | 148188140277 |
10 | 48513208651 |
11 | 19635494776 |
12 | 949ab85637 |
13 | 4761a2392b |
14 | 24c30a8a95 |
15 | 13de0a90a1 |
hex | b4b9cd14b |
48513208651 has 2 divisors, whose sum is σ = 48513208652. Its totient is φ = 48513208650.
The previous prime is 48513208633. The next prime is 48513208657. The reversal of 48513208651 is 15680231584.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48513208651 is a prime.
It is a super-2 number, since 2×485132086512 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 48513208598 and 48513208607.
It is not a weakly prime, because it can be changed into another prime (48513208657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24256604325 + 24256604326.
It is an arithmetic number, because the mean of its divisors is an integer number (24256604326).
Almost surely, 248513208651 is an apocalyptic number.
48513208651 is a deficient number, since it is larger than the sum of its proper divisors (1).
48513208651 is an equidigital number, since it uses as much as digits as its factorization.
48513208651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 230400, while the sum is 43.
The spelling of 48513208651 in words is "forty-eight billion, five hundred thirteen million, two hundred eight thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •