Base | Representation |
---|---|
bin | 100100011000100001001… |
… | …0110000001000010111001 |
3 | 122201001001022021112102021 |
4 | 1020301002112001002321 |
5 | 1123411412440001444 |
6 | 14345102144434441 |
7 | 1024161636125362 |
oct | 110610226010271 |
9 | 18631038245367 |
10 | 5000455000249 |
11 | 1658754538a25 |
12 | 689156318a21 |
13 | 2a3705421b97 |
14 | 134047d86b69 |
15 | 8a11764b584 |
hex | 48c425810b9 |
5000455000249 has 2 divisors, whose sum is σ = 5000455000250. Its totient is φ = 5000455000248.
The previous prime is 5000455000231. The next prime is 5000455000259. The reversal of 5000455000249 is 9420005540005.
It is a happy number.
5000455000249 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., 3327395533225 + 1673059467024 = 1824115^2 + 1293468^2 .
It is a cyclic number.
It is not a de Polignac number, because 5000455000249 - 29 = 5000454999737 is a prime.
It is a super-3 number, since 3×50004550002493 (a number of 39 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (5000455000259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2500227500124 + 2500227500125.
It is an arithmetic number, because the mean of its divisors is an integer number (2500227500125).
Almost surely, 25000455000249 is an apocalyptic number.
It is an amenable number.
5000455000249 is a deficient number, since it is larger than the sum of its proper divisors (1).
5000455000249 is an equidigital number, since it uses as much as digits as its factorization.
5000455000249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36000, while the sum is 34.
The spelling of 5000455000249 in words is "five trillion, four hundred fifty-five million, two hundred forty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •