Base | Representation |
---|---|
bin | 1001100111010000… |
… | …10000000011110101 |
3 | 111022200121221012112 |
4 | 10303220100003311 |
5 | 41032224004403 |
6 | 2212045300405 |
7 | 241620052346 |
oct | 46350200365 |
9 | 14280557175 |
10 | 5161156853 |
11 | 220937a596 |
12 | 1000564705 |
13 | 643365a88 |
14 | 36d6520cd |
15 | 20318b9d8 |
hex | 133a100f5 |
5161156853 has 2 divisors, whose sum is σ = 5161156854. Its totient is φ = 5161156852.
The previous prime is 5161156817. The next prime is 5161156901. The reversal of 5161156853 is 3586511615.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4998772804 + 162384049 = 70702^2 + 12743^2 .
It is a cyclic number.
It is not a de Polignac number, because 5161156853 - 230 = 4087415029 is a prime.
It is a super-3 number, since 3×51611568533 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 5161156853.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5161156453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2580578426 + 2580578427.
It is an arithmetic number, because the mean of its divisors is an integer number (2580578427).
Almost surely, 25161156853 is an apocalyptic number.
It is an amenable number.
5161156853 is a deficient number, since it is larger than the sum of its proper divisors (1).
5161156853 is an equidigital number, since it uses as much as digits as its factorization.
5161156853 is an evil number, because the sum of its binary digits is even.
The product of its digits is 108000, while the sum is 41.
The square root of 5161156853 is about 71841.1918957363. The cubic root of 5161156853 is about 1728.1536488042.
The spelling of 5161156853 in words is "five billion, one hundred sixty-one million, one hundred fifty-six thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •