Base | Representation |
---|---|
bin | 1001100111101110… |
… | …00000100111101101 |
3 | 111022221220111100212 |
4 | 10303313000213231 |
5 | 41034221311043 |
6 | 2212304232205 |
7 | 241664665115 |
oct | 46367004755 |
9 | 14287814325 |
10 | 5165025773 |
11 | 2210582346 |
12 | 100190b665 |
13 | 6440bba8b |
14 | 36dd7c045 |
15 | 2036a3018 |
hex | 133dc09ed |
5165025773 has 4 divisors (see below), whose sum is σ = 5343130140. Its totient is φ = 4986921408.
The previous prime is 5165025763. The next prime is 5165025829. The reversal of 5165025773 is 3775205615.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3407990884 + 1757034889 = 58378^2 + 41917^2 .
It is a cyclic number.
It is not a de Polignac number, because 5165025773 - 212 = 5165021677 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5165025773.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5165025763) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 89052140 + ... + 89052197.
It is an arithmetic number, because the mean of its divisors is an integer number (1335782535).
Almost surely, 25165025773 is an apocalyptic number.
It is an amenable number.
5165025773 is a deficient number, since it is larger than the sum of its proper divisors (178104367).
5165025773 is a wasteful number, since it uses less digits than its factorization.
5165025773 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178104366.
The product of its (nonzero) digits is 220500, while the sum is 41.
The square root of 5165025773 is about 71868.1137431615. The cubic root of 5165025773 is about 1728.5853619788.
The spelling of 5165025773 in words is "five billion, one hundred sixty-five million, twenty-five thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •