Base | Representation |
---|---|
bin | 111001000110010010011100… |
… | …0111000111011111110111101 |
3 | 2102212021211012211020002000120 |
4 | 1302030210320320323332331 |
5 | 1011312211141024022310 |
6 | 4540102325225245153 |
7 | 210534516455331351 |
oct | 16214447070737675 |
9 | 2385254184202016 |
10 | 502241545142205 |
11 | 136036496906020 |
12 | 483b59393337b9 |
13 | 18732236465cbb |
14 | 8c0489888d461 |
15 | 3d0e6c62ebb70 |
hex | 1c8c938e3bfbd |
502241545142205 has 128 divisors (see below), whose sum is σ = 886165076459520. Its totient is φ = 240870744576000.
The previous prime is 502241545142201. The next prime is 502241545142251.
502241545142205 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 502241545142205 - 22 = 502241545142201 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (502241545142201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 66425276625 + ... + 66425284185.
It is an arithmetic number, because the mean of its divisors is an integer number (6923164659840).
Almost surely, 2502241545142205 is an apocalyptic number.
502241545142205 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
502241545142205 is a deficient number, since it is larger than the sum of its proper divisors (383923531317315).
502241545142205 is a wasteful number, since it uses less digits than its factorization.
502241545142205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11643.
The product of its (nonzero) digits is 640000, while the sum is 42.
The spelling of 502241545142205 in words is "five hundred two trillion, two hundred forty-one billion, five hundred forty-five million, one hundred forty-two thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •