Base | Representation |
---|---|
bin | 1001010111010000… |
… | …01001100011010101 |
3 | 110222100000121112022 |
4 | 10223220021203111 |
5 | 40243342144334 |
6 | 2150452102525 |
7 | 235400023325 |
oct | 45350114325 |
9 | 13870017468 |
10 | 5026912469 |
11 | 214a619817 |
12 | b83604a45 |
13 | 6215c2427 |
14 | 3598a9285 |
15 | 1e64c082e |
hex | 12ba098d5 |
5026912469 has 2 divisors, whose sum is σ = 5026912470. Its totient is φ = 5026912468.
The previous prime is 5026912417. The next prime is 5026912481. The reversal of 5026912469 is 9642196205.
5026912469 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5022556900 + 4355569 = 70870^2 + 2087^2 .
It is a cyclic number.
It is not a de Polignac number, because 5026912469 - 220 = 5025863893 is a prime.
It is a super-2 number, since 2×50269124692 = 50539697941975351922, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5026912489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2513456234 + 2513456235.
It is an arithmetic number, because the mean of its divisors is an integer number (2513456235).
Almost surely, 25026912469 is an apocalyptic number.
It is an amenable number.
5026912469 is a deficient number, since it is larger than the sum of its proper divisors (1).
5026912469 is an equidigital number, since it uses as much as digits as its factorization.
5026912469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 233280, while the sum is 44.
The square root of 5026912469 is about 70900.7226267829. The cubic root of 5026912469 is about 1713.0384369300.
The spelling of 5026912469 in words is "five billion, twenty-six million, nine hundred twelve thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •