Base | Representation |
---|---|
bin | 11101110101010011010… |
… | …10101011000000001001 |
3 | 10121222211102001212122200 |
4 | 32322221222223000021 |
5 | 113243244440032022 |
6 | 2102522332110413 |
7 | 134025443426634 |
oct | 16725152530011 |
9 | 3558742055580 |
10 | 1025048752137 |
11 | 3657a2330143 |
12 | 1467b2905409 |
13 | 7587a941477 |
14 | 37881080c1b |
15 | 1b9e5868bac |
hex | eea9aab009 |
1025048752137 has 24 divisors (see below), whose sum is σ = 1559307484800. Its totient is φ = 647086084128.
The previous prime is 1025048752121. The next prime is 1025048752151. The reversal of 1025048752137 is 7312578405201.
1025048752137 is a `hidden beast` number, since 1 + 0 + 2 + 50 + 48 + 7 + 521 + 37 = 666.
It is not a de Polignac number, because 1025048752137 - 24 = 1025048752121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1025048752092 and 1025048752101.
It is not an unprimeable number, because it can be changed into a prime (1025048752337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1094833 + ... + 1802430.
It is an arithmetic number, because the mean of its divisors is an integer number (64971145200).
Almost surely, 21025048752137 is an apocalyptic number.
It is an amenable number.
1025048752137 is a deficient number, since it is larger than the sum of its proper divisors (534258732663).
1025048752137 is a wasteful number, since it uses less digits than its factorization.
1025048752137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2899357 (or 2899354 counting only the distinct ones).
The product of its (nonzero) digits is 470400, while the sum is 45.
The spelling of 1025048752137 in words is "one trillion, twenty-five billion, forty-eight million, seven hundred fifty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •