Base | Representation |
---|---|
bin | 1110111111101101… |
… | …0001001000101101 |
3 | 101101112021222121022 |
4 | 3233323101020231 |
5 | 31220433310214 |
6 | 1503231543525 |
7 | 201515261114 |
oct | 35773211055 |
9 | 11345258538 |
10 | 4025291309 |
11 | 1786198a36 |
12 | 94408aba5 |
13 | 4c1c383a0 |
14 | 2a2858c7b |
15 | 1885bdd8e |
hex | efed122d |
4025291309 has 8 divisors (see below), whose sum is σ = 4452089880. Its totient is φ = 3615230016.
The previous prime is 4025291293. The next prime is 4025291339. The reversal of 4025291309 is 9031925204.
It can be written as a sum of positive squares in 4 ways, for example, as 520296100 + 3504995209 = 22810^2 + 59203^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4025291309 - 24 = 4025291293 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4025291339) 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 7 ways as a sum of consecutive naturals, for example, 4183814 + ... + 4184775.
It is an arithmetic number, because the mean of its divisors is an integer number (556511235).
Almost surely, 24025291309 is an apocalyptic number.
It is an amenable number.
4025291309 is a deficient number, since it is larger than the sum of its proper divisors (426798571).
4025291309 is a wasteful number, since it uses less digits than its factorization.
4025291309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8368639.
The product of its (nonzero) digits is 19440, while the sum is 35.
The square root of 4025291309 is about 63445.1834972522. The cubic root of 4025291309 is about 1590.7396462482.
The spelling of 4025291309 in words is "four billion, twenty-five million, two hundred ninety-one thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •