Base | Representation |
---|---|
bin | 100100011010100000100… |
… | …111001110100100101101 |
3 | 22212020001011100201000210 |
4 | 210122200213032210231 |
5 | 311444321043313031 |
6 | 5153323151213033 |
7 | 345534644453454 |
oct | 44324047164455 |
9 | 8766034321023 |
10 | 2502365604141 |
11 | 88527a168727 |
12 | 344b85217179 |
13 | 151c83816cc0 |
14 | 89187d3bb9b |
15 | 4515b640746 |
hex | 246a09ce92d |
2502365604141 has 16 divisors (see below), whose sum is σ = 3593462571776. Its totient is φ = 1539779201856.
The previous prime is 2502365604139. The next prime is 2502365604149. The reversal of 2502365604141 is 1414065632052.
It is not a de Polignac number, because 2502365604141 - 21 = 2502365604139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2502365604141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2502365604149) 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 15 ways as a sum of consecutive naturals, for example, 2435605 + ... + 3307098.
It is an arithmetic number, because the mean of its divisors is an integer number (224591410736).
Almost surely, 22502365604141 is an apocalyptic number.
It is an amenable number.
2502365604141 is a deficient number, since it is larger than the sum of its proper divisors (1091096967635).
2502365604141 is a wasteful number, since it uses less digits than its factorization.
2502365604141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5753892.
The product of its (nonzero) digits is 172800, while the sum is 39.
The spelling of 2502365604141 in words is "two trillion, five hundred two billion, three hundred sixty-five million, six hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •