Base | Representation |
---|---|
bin | 100100011000011011001… |
… | …000110111011001001001 |
3 | 22212000021002200000010211 |
4 | 210120123020313121021 |
5 | 311430224311301040 |
6 | 5152313034441121 |
7 | 345425313462502 |
oct | 44303310673111 |
9 | 8760232600124 |
10 | 2500126275145 |
11 | 884330116704 |
12 | 34465b2931a1 |
13 | 1519b78c5365 |
14 | 89014783ba9 |
15 | 45079c558ea |
hex | 2461b237649 |
2500126275145 has 32 divisors (see below), whose sum is σ = 3109540275072. Its totient is φ = 1928415616512.
The previous prime is 2500126275139. The next prime is 2500126275187. The reversal of 2500126275145 is 5415726210052.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2500126275145 is a prime.
It is a super-3 number, since 3×25001262751453 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2500126275098 and 2500126275107.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 21230367 + ... + 21347803.
It is an arithmetic number, because the mean of its divisors is an integer number (97173133596).
Almost surely, 22500126275145 is an apocalyptic number.
It is an amenable number.
2500126275145 is a deficient number, since it is larger than the sum of its proper divisors (609413999927).
2500126275145 is a wasteful number, since it uses less digits than its factorization.
2500126275145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118761.
The product of its (nonzero) digits is 168000, while the sum is 40.
The spelling of 2500126275145 in words is "two trillion, five hundred billion, one hundred twenty-six million, two hundred seventy-five thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •