Base | Representation |
---|---|
bin | 111101000111101… |
… | …011000100100001 |
3 | 2122110111210222211 |
4 | 331013223010201 |
5 | 4100001442401 |
6 | 245430202121 |
7 | 34260640231 |
oct | 7507530441 |
9 | 2573453884 |
10 | 1025421601 |
11 | 486907476 |
12 | 2474b3341 |
13 | 13459b259 |
14 | 9a287cc1 |
15 | 60053951 |
hex | 3d1eb121 |
1025421601 has 2 divisors, whose sum is σ = 1025421602. Its totient is φ = 1025421600.
The previous prime is 1025421587. The next prime is 1025421647. The reversal of 1025421601 is 1061245201.
1025421601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 993510400 + 31911201 = 31520^2 + 5649^2 .
It is an emirp because it is prime and its reverse (1061245201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1025421601 - 213 = 1025413409 is a prime.
It is not a weakly prime, because it can be changed into another prime (1025421671) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 512710800 + 512710801.
It is an arithmetic number, because the mean of its divisors is an integer number (512710801).
Almost surely, 21025421601 is an apocalyptic number.
It is an amenable number.
1025421601 is a deficient number, since it is larger than the sum of its proper divisors (1).
1025421601 is an equidigital number, since it uses as much as digits as its factorization.
1025421601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 1025421601 is about 32022.2048116615. The cubic root of 1025421601 is about 1008.4030578352.
Adding to 1025421601 its reverse (1061245201), we get a palindrome (2086666802).
The spelling of 1025421601 in words is "one billion, twenty-five million, four hundred twenty-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •