Base | Representation |
---|---|
bin | 100011111001011011001… |
… | …0001010101001000110101 |
3 | 122110122200200012000202011 |
4 | 1013302312101111020311 |
5 | 1121313134143432044 |
6 | 14254300154244221 |
7 | 1016306125622521 |
oct | 107626621251065 |
9 | 18418620160664 |
10 | 4933680452149 |
11 | 16323a8aa3689 |
12 | 67821b726671 |
13 | 29a3232b7b67 |
14 | 130b118a2d81 |
15 | 8850a2b5134 |
hex | 47cb6455235 |
4933680452149 has 2 divisors, whose sum is σ = 4933680452150. Its totient is φ = 4933680452148.
The previous prime is 4933680452117. The next prime is 4933680452153. The reversal of 4933680452149 is 9412540863394.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2707637340100 + 2226043112049 = 1645490^2 + 1491993^2 .
It is a cyclic number.
It is not a de Polignac number, because 4933680452149 - 25 = 4933680452117 is a prime.
It is a super-2 number, since 2×49336804521492 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4933680452093 and 4933680452102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4933680452159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2466840226074 + 2466840226075.
It is an arithmetic number, because the mean of its divisors is an integer number (2466840226075).
Almost surely, 24933680452149 is an apocalyptic number.
It is an amenable number.
4933680452149 is a deficient number, since it is larger than the sum of its proper divisors (1).
4933680452149 is an equidigital number, since it uses as much as digits as its factorization.
4933680452149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22394880, while the sum is 58.
The spelling of 4933680452149 in words is "four trillion, nine hundred thirty-three billion, six hundred eighty million, four hundred fifty-two thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •