Base | Representation |
---|---|
bin | 111000110110111100001101… |
… | …1111011000100111001110001 |
3 | 2102120211011201001001212200212 |
4 | 1301231320123323010321301 |
5 | 1011023131301414041200 |
6 | 4531405324050153505 |
7 | 210226234620331334 |
oct | 16155703373047161 |
9 | 2376734631055625 |
10 | 500132230221425 |
11 | 1353a29845a32aa |
12 | 48114b87b82895 |
13 | 1860b36161b869 |
14 | 8b70759bcc61b |
15 | 3cc48c144d035 |
hex | 1c6de1bec4e71 |
500132230221425 has 6 divisors (see below), whose sum is σ = 620163965474598. Its totient is φ = 400105784177120.
The previous prime is 500132230221409. The next prime is 500132230221467. The reversal of 500132230221425 is 524122032231005.
It can be written as a sum of positive squares in 3 ways, for example, as 7213328263696 + 492918901957729 = 2685764^2 + 22201777^2 .
It is not a de Polignac number, because 500132230221425 - 24 = 500132230221409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 500132230221391 and 500132230221400.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 10002644604404 + ... + 10002644604453.
It is an arithmetic number, because the mean of its divisors is an integer number (103360660912433).
Almost surely, 2500132230221425 is an apocalyptic number.
It is an amenable number.
500132230221425 is a deficient number, since it is larger than the sum of its proper divisors (120031735253173).
500132230221425 is a wasteful number, since it uses less digits than its factorization.
500132230221425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20005289208867 (or 20005289208862 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 32.
The spelling of 500132230221425 in words is "five hundred trillion, one hundred thirty-two billion, two hundred thirty million, two hundred twenty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •