Base | Representation |
---|---|
bin | 1110000000100011001111… |
… | …1111111011111101011001 |
3 | 2000112110212102112202211012 |
4 | 3200020303333323331121 |
5 | 4004324034012402022 |
6 | 52431511315143305 |
7 | 3146542260232661 |
oct | 340106377737531 |
9 | 60473772482735 |
10 | 15402625122137 |
11 | 49a9242377000 |
12 | 188916bba4b35 |
13 | 8795cc688716 |
14 | 3b36c35791a1 |
15 | 1ba9ce751de2 |
hex | e0233ffbf59 |
15402625122137 has 16 divisors (see below), whose sum is σ = 16943810740224. Its totient is φ = 14000667080400.
The previous prime is 15402625122127. The next prime is 15402625122139. The reversal of 15402625122137 is 73122152620451.
It is not a de Polignac number, because 15402625122137 - 220 = 15402624073561 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15402625122094 and 15402625122103.
It is not an unprimeable number, because it can be changed into a prime (15402625122139) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10195823 + ... + 11608619.
It is an arithmetic number, because the mean of its divisors is an integer number (1058988171264).
Almost surely, 215402625122137 is an apocalyptic number.
It is an amenable number.
15402625122137 is a deficient number, since it is larger than the sum of its proper divisors (1541185618087).
15402625122137 is an equidigital number, since it uses as much as digits as its factorization.
15402625122137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1421021 (or 1420999 counting only the distinct ones).
The product of its (nonzero) digits is 201600, while the sum is 41.
Adding to 15402625122137 its reverse (73122152620451), we get a palindrome (88524777742588).
The spelling of 15402625122137 in words is "fifteen trillion, four hundred two billion, six hundred twenty-five million, one hundred twenty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •