Base | Representation |
---|---|
bin | 1001011011110110… |
… | …00001011100011111 |
3 | 111002000110201021220 |
4 | 10231323001130133 |
5 | 40333221230211 |
6 | 2154345224423 |
7 | 236345212050 |
oct | 45573013437 |
9 | 14060421256 |
10 | 5065414431 |
11 | 216a326920 |
12 | b94492113 |
13 | 62958315c |
14 | 360a4c727 |
15 | 1e9a78806 |
hex | 12dec171f |
5065414431 has 32 divisors (see below), whose sum is σ = 8486780928. Its totient is φ = 2610649440.
The previous prime is 5065414423. The next prime is 5065414433. The reversal of 5065414431 is 1344145605.
It is not a de Polignac number, because 5065414431 - 23 = 5065414423 is a prime.
It is a super-2 number, since 2×50654144312 = 51316846715566107522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 5065414392 and 5065414401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5065414433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 56995 + ... + 115668.
It is an arithmetic number, because the mean of its divisors is an integer number (265211904).
Almost surely, 25065414431 is an apocalyptic number.
5065414431 is a deficient number, since it is larger than the sum of its proper divisors (3421366497).
5065414431 is a wasteful number, since it uses less digits than its factorization.
5065414431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172811.
The product of its (nonzero) digits is 28800, while the sum is 33.
The square root of 5065414431 is about 71171.7249404565. The cubic root of 5065414431 is about 1717.4008009337.
The spelling of 5065414431 in words is "five billion, sixty-five million, four hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •