Base | Representation |
---|---|
bin | 1001010101010110… |
… | …11111011111100001 |
3 | 110221020002202120111 |
4 | 10222223133133201 |
5 | 40230304332203 |
6 | 2145123211321 |
7 | 235114616062 |
oct | 45253373741 |
9 | 13836082514 |
10 | 5011011553 |
11 | 2141649169 |
12 | b7a216b41 |
13 | 61b2159c2 |
14 | 35772a569 |
15 | 1e4dce26d |
hex | 12aadf7e1 |
5011011553 has 2 divisors, whose sum is σ = 5011011554. Its totient is φ = 5011011552.
The previous prime is 5011011527. The next prime is 5011011559. The reversal of 5011011553 is 3551101105.
5011011553 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., 4540468689 + 470542864 = 67383^2 + 21692^2 .
It is a cyclic number.
It is not a de Polignac number, because 5011011553 - 25 = 5011011521 is a prime.
It is a super-2 number, since 2×50110115532 = 50220473568598943618, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5011011559) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2505505776 + 2505505777.
It is an arithmetic number, because the mean of its divisors is an integer number (2505505777).
Almost surely, 25011011553 is an apocalyptic number.
It is an amenable number.
5011011553 is a deficient number, since it is larger than the sum of its proper divisors (1).
5011011553 is an equidigital number, since it uses as much as digits as its factorization.
5011011553 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 375, while the sum is 22.
The square root of 5011011553 is about 70788.4987339045. The cubic root of 5011011553 is about 1711.2303256672.
Adding to 5011011553 its reverse (3551101105), we get a palindrome (8562112658).
The spelling of 5011011553 in words is "five billion, eleven million, eleven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •