Base | Representation |
---|---|
bin | 111000110111101111101011… |
… | …0010110001010001001011111 |
3 | 2102121012201221002210011112220 |
4 | 1301233133112112022021133 |
5 | 1011031434103402043000 |
6 | 4531532201044200423 |
7 | 210240226144445565 |
oct | 16157372626121137 |
9 | 2377181832704486 |
10 | 500242732065375 |
11 | 135435829a4a182 |
12 | 48132486999113 |
13 | 186188c1a97c40 |
14 | 8b75c3d8c7a35 |
15 | 3cc76dc6251a0 |
hex | 1c6f7d658a25f |
500242732065375 has 32 divisors (see below), whose sum is σ = 896434975869888. Its totient is φ = 246273345014400.
The previous prime is 500242732065347. The next prime is 500242732065397. The reversal of 500242732065375 is 573560237242005.
It is not a de Polignac number, because 500242732065375 - 27 = 500242732065247 is a prime.
It is a super-2 number, since 2×5002427320653752 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 51306942004 + ... + 51306951753.
It is an arithmetic number, because the mean of its divisors is an integer number (28013592995934).
Almost surely, 2500242732065375 is an apocalyptic number.
500242732065375 is a deficient number, since it is larger than the sum of its proper divisors (396192243804513).
500242732065375 is a wasteful number, since it uses less digits than its factorization.
500242732065375 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102613893788 (or 102613893778 counting only the distinct ones).
The product of its (nonzero) digits is 10584000, while the sum is 51.
The spelling of 500242732065375 in words is "five hundred trillion, two hundred forty-two billion, seven hundred thirty-two million, sixty-five thousand, three hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •