Base | Representation |
---|---|
bin | 100100011000100101110… |
… | …010101100000010011000 |
3 | 22212000201112222201102101 |
4 | 210120211302230002120 |
5 | 311431111040321330 |
6 | 5152342501413144 |
7 | 345432613634020 |
oct | 44304562540230 |
9 | 8760645881371 |
10 | 2500305010840 |
11 | 884411aa545a |
12 | 3446ab10a1b4 |
13 | 151a15945920 |
14 | 890303cca80 |
15 | 4508a7ae4ca |
hex | 24625cac098 |
2500305010840 has 64 divisors (see below), whose sum is σ = 6923921578560. Its totient is φ = 791305320960.
The previous prime is 2500305010789. The next prime is 2500305010873. The reversal of 2500305010840 is 480105030052.
It is a super-2 number, since 2×25003050108402 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 2500305010799 and 2500305010808.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 343444851 + ... + 343452130.
It is an arithmetic number, because the mean of its divisors is an integer number (108186274665).
Almost surely, 22500305010840 is an apocalyptic number.
2500305010840 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2500305010840 is an abundant number, since it is smaller than the sum of its proper divisors (4423616567720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2500305010840 is a wasteful number, since it uses less digits than its factorization.
2500305010840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 686897012 (or 686897008 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
The spelling of 2500305010840 in words is "two trillion, five hundred billion, three hundred five million, ten thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •