Base | Representation |
---|---|
bin | 100100110111111110010… |
… | …010100010011110101001 |
3 | 22222020200221211122021020 |
4 | 210313332102202132221 |
5 | 313004114003310100 |
6 | 5220034321203053 |
7 | 351034634461113 |
oct | 44677622423651 |
9 | 8866627748236 |
10 | 2534002010025 |
11 | 897734089712 |
12 | 34b134190489 |
13 | 154c55c207b5 |
14 | 8a9098363b3 |
15 | 45dadc5a5a0 |
hex | 24dfe4a27a9 |
2534002010025 has 24 divisors (see below), whose sum is σ = 4189643375424. Its totient is φ = 1351437614400.
The previous prime is 2534002010003. The next prime is 2534002010173. The reversal of 2534002010025 is 5200102004352.
It is not a de Polignac number, because 2534002010025 - 219 = 2534001485737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2534002009977 and 2534002010004.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 3240727 + ... + 3945923.
It is an arithmetic number, because the mean of its divisors is an integer number (174568473976).
Almost surely, 22534002010025 is an apocalyptic number.
2534002010025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2534002010025 is a deficient number, since it is larger than the sum of its proper divisors (1655641365399).
2534002010025 is a wasteful number, since it uses less digits than its factorization.
2534002010025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 753121 (or 753116 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 24.
Adding to 2534002010025 its reverse (5200102004352), we get a palindrome (7734104014377).
The spelling of 2534002010025 in words is "two trillion, five hundred thirty-four billion, two million, ten thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •