Base | Representation |
---|---|
bin | 111101001001100… |
… | …011111110001001 |
3 | 2122111102222021212 |
4 | 331021203332021 |
5 | 4100113314214 |
6 | 245444542505 |
7 | 34265102051 |
oct | 7511437611 |
9 | 2574388255 |
10 | 1025916809 |
11 | 487115535 |
12 | 2476b1a35 |
13 | 134712788 |
14 | 9a376561 |
15 | 6010053e |
hex | 3d263f89 |
1025916809 has 4 divisors (see below), whose sum is σ = 1026533904. Its totient is φ = 1025299716.
The previous prime is 1025916803. The next prime is 1025916811. The reversal of 1025916809 is 9086195201.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1025916809 - 28 = 1025916553 is a prime.
It is a super-3 number, since 3×10259168093 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1025916803) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 306047 + ... + 309380.
It is an arithmetic number, because the mean of its divisors is an integer number (256633476).
Almost surely, 21025916809 is an apocalyptic number.
It is an amenable number.
1025916809 is a deficient number, since it is larger than the sum of its proper divisors (617095).
1025916809 is an equidigital number, since it uses as much as digits as its factorization.
1025916809 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617094.
The product of its (nonzero) digits is 38880, while the sum is 41.
The square root of 1025916809 is about 32029.9361379320. The cubic root of 1025916809 is about 1008.5653614495.
The spelling of 1025916809 in words is "one billion, twenty-five million, nine hundred sixteen thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •