Base | Representation |
---|---|
bin | 1001010010000000… |
… | …10011001001000001 |
3 | 110212021020010121202 |
4 | 10221000103021001 |
5 | 40201111132203 |
6 | 2142241030545 |
7 | 234324022634 |
oct | 45100231101 |
9 | 13767203552 |
10 | 4982911553 |
11 | 21277a6224 |
12 | b70925455 |
13 | 615457799 |
14 | 353ad3c1b |
15 | 1e26cd388 |
hex | 129013241 |
4982911553 has 2 divisors, whose sum is σ = 4982911554. Its totient is φ = 4982911552.
The previous prime is 4982911543. The next prime is 4982911559. The reversal of 4982911553 is 3551192894.
4982911553 is digitally balanced in base 3, 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., 4137962929 + 844948624 = 64327^2 + 29068^2 .
It is a cyclic number.
It is not a de Polignac number, because 4982911553 - 26 = 4982911489 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4982911498 and 4982911507.
It is not a weakly prime, because it can be changed into another prime (4982911559) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2491455776 + 2491455777.
It is an arithmetic number, because the mean of its divisors is an integer number (2491455777).
Almost surely, 24982911553 is an apocalyptic number.
It is an amenable number.
4982911553 is a deficient number, since it is larger than the sum of its proper divisors (1).
4982911553 is an equidigital number, since it uses as much as digits as its factorization.
4982911553 is an evil number, because the sum of its binary digits is even.
The product of its digits is 388800, while the sum is 47.
The square root of 4982911553 is about 70589.7411314137. The cubic root of 4982911553 is about 1708.0256676146.
The spelling of 4982911553 in words is "four billion, nine hundred eighty-two million, nine hundred eleven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •