Base | Representation |
---|---|
bin | 1001010111000110… |
… | …00100101101111001 |
3 | 110222020112000101122 |
4 | 10223203010231321 |
5 | 40243022110240 |
6 | 2150403355025 |
7 | 235352512256 |
oct | 45343045571 |
9 | 13866460348 |
10 | 5025581945 |
11 | 21498a010a |
12 | b83082a75 |
13 | 621247937 |
14 | 35964042d |
15 | 1e630b4b5 |
hex | 12b8c4b79 |
5025581945 has 8 divisors (see below), whose sum is σ = 6132913920. Its totient is φ = 3952321840.
The previous prime is 5025581927. The next prime is 5025581959. The reversal of 5025581945 is 5491855205.
5025581945 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5025581945 - 212 = 5025577849 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5025581896 and 5025581905.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8517641 + ... + 8518230.
It is an arithmetic number, because the mean of its divisors is an integer number (766614240).
Almost surely, 25025581945 is an apocalyptic number.
It is an amenable number.
5025581945 is a deficient number, since it is larger than the sum of its proper divisors (1107331975).
5025581945 is a wasteful number, since it uses less digits than its factorization.
5025581945 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17035935.
The product of its (nonzero) digits is 360000, while the sum is 44.
The square root of 5025581945 is about 70891.3389984983. The cubic root of 5025581945 is about 1712.8872878309.
The spelling of 5025581945 in words is "five billion, twenty-five million, five hundred eighty-one thousand, nine hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •