Base | Representation |
---|---|
bin | 1011011011110100001110… |
… | …00010011011100100011001 |
3 | 10022000211122120101202012021 |
4 | 11231322013002123210121 |
5 | 11243433432023042103 |
6 | 125251242212014441 |
7 | 5203444433265442 |
oct | 555720702334431 |
9 | 108024576352167 |
10 | 25145004112153 |
11 | 8014a33324212 |
12 | 29a132b001421 |
13 | 11052188a84a3 |
14 | 62d04ba842c9 |
15 | 2d912c793bbd |
hex | 16de8709b919 |
25145004112153 has 4 divisors (see below), whose sum is σ = 25145022613120. Its totient is φ = 25144985611188.
The previous prime is 25145004112141. The next prime is 25145004112237. The reversal of 25145004112153 is 35121140054152.
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 25145004112153 - 29 = 25145004111641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (25145004110153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7034925 + ... + 9989002.
It is an arithmetic number, because the mean of its divisors is an integer number (6286255653280).
Almost surely, 225145004112153 is an apocalyptic number.
It is an amenable number.
25145004112153 is a deficient number, since it is larger than the sum of its proper divisors (18500967).
25145004112153 is a wasteful number, since it uses less digits than its factorization.
25145004112153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18500966.
The product of its (nonzero) digits is 24000, while the sum is 34.
The spelling of 25145004112153 in words is "twenty-five trillion, one hundred forty-five billion, four million, one hundred twelve thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •