Base | Representation |
---|---|
bin | 10111011000001100… |
… | …110001011100101001 |
3 | 2101210101221221110220 |
4 | 113120030301130221 |
5 | 402402112012101 |
6 | 15310504200253 |
7 | 1546024006212 |
oct | 273014613451 |
9 | 71711857426 |
10 | 25102063401 |
11 | a711507848 |
12 | 4a46769089 |
13 | 24a072026c |
14 | 1301b54409 |
15 | 9bdb33636 |
hex | 5d8331729 |
25102063401 has 4 divisors (see below), whose sum is σ = 33469417872. Its totient is φ = 16734708932.
The previous prime is 25102063391. The next prime is 25102063429. The reversal of 25102063401 is 10436020152.
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 25102063401 - 25 = 25102063369 is a prime.
It is a super-2 number, since 2×251020634012 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (25102063451) 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, 4183677231 + ... + 4183677236.
It is an arithmetic number, because the mean of its divisors is an integer number (8367354468).
Almost surely, 225102063401 is an apocalyptic number.
It is an amenable number.
25102063401 is a deficient number, since it is larger than the sum of its proper divisors (8367354471).
25102063401 is an equidigital number, since it uses as much as digits as its factorization.
25102063401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8367354470.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 25102063401 its reverse (10436020152), we get a palindrome (35538083553).
The spelling of 25102063401 in words is "twenty-five billion, one hundred two million, sixty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •