Base | Representation |
---|---|
bin | 111101000110010… |
… | …101100101000011 |
3 | 2122102212000122102 |
4 | 331012111211003 |
5 | 4044404241202 |
6 | 245414501015 |
7 | 34254651302 |
oct | 7506254503 |
9 | 2572760572 |
10 | 1025071427 |
11 | 486698376 |
12 | 24736476b |
13 | 1344a7a53 |
14 | 9a1d6439 |
15 | 5eed4d02 |
hex | 3d195943 |
1025071427 has 4 divisors (see below), whose sum is σ = 1025687280. Its totient is φ = 1024455576.
The previous prime is 1025071409. The next prime is 1025071447. The reversal of 1025071427 is 7241705201.
1025071427 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1025071427 - 212 = 1025067331 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1025071427.
It is not an unprimeable number, because it can be changed into a prime (1025071447) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 305423 + ... + 308760.
It is an arithmetic number, because the mean of its divisors is an integer number (256421820).
Almost surely, 21025071427 is an apocalyptic number.
1025071427 is a deficient number, since it is larger than the sum of its proper divisors (615853).
1025071427 is an equidigital number, since it uses as much as digits as its factorization.
1025071427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 615852.
The product of its (nonzero) digits is 3920, while the sum is 29.
The square root of 1025071427 is about 32016.7366700606. The cubic root of 1025071427 is about 1008.2882573358.
Adding to 1025071427 its reverse (7241705201), we get a palindrome (8266776628).
The spelling of 1025071427 in words is "one billion, twenty-five million, seventy-one thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •