Base | Representation |
---|---|
bin | 1001011101101110… |
… | …11011101010001001 |
3 | 111010010021021012210 |
4 | 10232313123222021 |
5 | 40401300003231 |
6 | 2200112455333 |
7 | 236626626141 |
oct | 45667335211 |
9 | 14103237183 |
10 | 5081250441 |
11 | 2178262733 |
12 | b9984a549 |
13 | 62c939187 |
14 | 362bb1921 |
15 | 1eb155a46 |
hex | 12eddba89 |
5081250441 has 16 divisors (see below), whose sum is σ = 6961579328. Its totient is φ = 3294302400.
The previous prime is 5081250409. The next prime is 5081250443. The reversal of 5081250441 is 1440521805.
It is not a de Polignac number, because 5081250441 - 25 = 5081250409 is a prime.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5081250399 and 5081250408.
It is not an unprimeable number, because it can be changed into a prime (5081250443) 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 15 ways as a sum of consecutive naturals, for example, 236226 + ... + 256836.
It is an arithmetic number, because the mean of its divisors is an integer number (435098708).
Almost surely, 25081250441 is an apocalyptic number.
It is an amenable number.
5081250441 is a deficient number, since it is larger than the sum of its proper divisors (1880328887).
5081250441 is a wasteful number, since it uses less digits than its factorization.
5081250441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22872.
The product of its (nonzero) digits is 6400, while the sum is 30.
The square root of 5081250441 is about 71282.8902402252. The cubic root of 5081250441 is about 1719.1886430397.
The spelling of 5081250441 in words is "five billion, eighty-one million, two hundred fifty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •