Base | Representation |
---|---|
bin | 1011011010100111111010… |
… | …11010010110010001001011 |
3 | 10021212220220201222121011122 |
4 | 11231103331122112101023 |
5 | 11242301033321423202 |
6 | 125220345325545455 |
7 | 5200464344534663 |
oct | 555237532262113 |
9 | 107786821877148 |
10 | 25104040420427 |
11 | 7aa96223a1331 |
12 | 29953b841528b |
13 | 11013bac8c147 |
14 | 62b0834db1a3 |
15 | 2d803139d9a2 |
hex | 16d4fd69644b |
25104040420427 has 8 divisors (see below), whose sum is σ = 25129055967600. Its totient is φ = 25079025619584.
The previous prime is 25104040420423. The next prime is 25104040420429. The reversal of 25104040420427 is 72402404040152.
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 25104040420427 - 22 = 25104040420423 is a prime.
It is a super-4 number, since 4×251040404204274 (a number of 55 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (25104040420421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87630599 + ... + 87916607.
It is an arithmetic number, because the mean of its divisors is an integer number (3141131995950).
Almost surely, 225104040420427 is an apocalyptic number.
25104040420427 is a deficient number, since it is larger than the sum of its proper divisors (25015547173).
25104040420427 is a wasteful number, since it uses less digits than its factorization.
25104040420427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373165.
The product of its (nonzero) digits is 71680, while the sum is 35.
Adding to 25104040420427 its reverse (72402404040152), we get a palindrome (97506444460579).
The spelling of 25104040420427 in words is "twenty-five trillion, one hundred four billion, forty million, four hundred twenty thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •