Base | Representation |
---|---|
bin | 1001011011010010… |
… | …10010001001011001 |
3 | 111001200201110102221 |
4 | 10231221102021121 |
5 | 40331023423444 |
6 | 2154101424041 |
7 | 236260533502 |
oct | 45551221131 |
9 | 14050643387 |
10 | 5060764249 |
11 | 21677400a2 |
12 | b92a0b021 |
13 | 628615678 |
14 | 36019bba9 |
15 | 1e945aa84 |
hex | 12da52259 |
5060764249 has 4 divisors (see below), whose sum is σ = 5073512164. Its totient is φ = 5048016336.
The previous prime is 5060764237. The next prime is 5060764271. The reversal of 5060764249 is 9424670605.
It is a happy number.
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 1801153600 + 3259610649 = 42440^2 + 57093^2 .
It is a cyclic number.
It is not a de Polignac number, because 5060764249 - 25 = 5060764217 is a prime.
It is a super-2 number, since 2×50607642492 = 51222669567913068002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5060764349) 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, 6373362 + ... + 6374155.
It is an arithmetic number, because the mean of its divisors is an integer number (1268378041).
Almost surely, 25060764249 is an apocalyptic number.
It is an amenable number.
5060764249 is a deficient number, since it is larger than the sum of its proper divisors (12747915).
5060764249 is a wasteful number, since it uses less digits than its factorization.
5060764249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12747914.
The product of its (nonzero) digits is 362880, while the sum is 43.
The square root of 5060764249 is about 71139.0486933864. The cubic root of 5060764249 is about 1716.8751005196.
The spelling of 5060764249 in words is "five billion, sixty million, seven hundred sixty-four thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •