Base | Representation |
---|---|
bin | 1001100111101110… |
… | …01010100011010101 |
3 | 111022221222120011112 |
4 | 10303313022203111 |
5 | 41034224111303 |
6 | 2212305144405 |
7 | 241665224531 |
oct | 46367124325 |
9 | 14287876145 |
10 | 5165066453 |
11 | 22105aa968 |
12 | 100192b105 |
13 | 644104451 |
14 | 36dd8cbc1 |
15 | 2036b00d8 |
hex | 133dca8d5 |
5165066453 has 2 divisors, whose sum is σ = 5165066454. Its totient is φ = 5165066452.
The previous prime is 5165066329. The next prime is 5165066483. The reversal of 5165066453 is 3546605615.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4668578929 + 496487524 = 68327^2 + 22282^2 .
It is a cyclic number.
It is not a de Polignac number, because 5165066453 - 210 = 5165065429 is a prime.
It is a super-2 number, since 2×51650664532 = 53355822927812002418, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5165066453.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5165066483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2582533226 + 2582533227.
It is an arithmetic number, because the mean of its divisors is an integer number (2582533227).
Almost surely, 25165066453 is an apocalyptic number.
It is an amenable number.
5165066453 is a deficient number, since it is larger than the sum of its proper divisors (1).
5165066453 is an equidigital number, since it uses as much as digits as its factorization.
5165066453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324000, while the sum is 41.
The square root of 5165066453 is about 71868.3967610242. The cubic root of 5165066453 is about 1728.5899001083.
The spelling of 5165066453 in words is "five billion, one hundred sixty-five million, sixty-six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •