Base | Representation |
---|---|
bin | 111001101001010101001001… |
… | …0100100001101010001101100 |
3 | 2110111100020120111022120111220 |
4 | 1303102222102210031101230 |
5 | 1012430113141221340033 |
6 | 4554231032325543340 |
7 | 211542465460204152 |
oct | 16322522244152154 |
9 | 2414306514276456 |
10 | 507057707996268 |
11 | 137622a6a218910 |
12 | 48a53220574b50 |
13 | 189c144b943b70 |
14 | 8d2da1c9993d2 |
15 | 3d94b0450cbb3 |
hex | 1cd2a9290d46c |
507057707996268 has 48 divisors (see below), whose sum is σ = 1389976374372096. Its totient is φ = 141834323914560.
The previous prime is 507057707996219. The next prime is 507057707996269. The reversal of 507057707996268 is 862699707750705.
It is a Harshad number since it is a multiple of its sum of digits (78).
It is a junction number, because it is equal to n+sod(n) for n = 507057707996193 and 507057707996202.
It is not an unprimeable number, because it can be changed into a prime (507057707996269) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 147744085696 + ... + 147744089127.
It is an arithmetic number, because the mean of its divisors is an integer number (28957841132752).
Almost surely, 2507057707996268 is an apocalyptic number.
It is an amenable number.
507057707996268 is an abundant number, since it is smaller than the sum of its proper divisors (882918666375828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
507057707996268 is a wasteful number, since it uses less digits than its factorization.
507057707996268 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 295488174854 (or 295488174852 counting only the distinct ones).
The product of its (nonzero) digits is 2800526400, while the sum is 78.
The spelling of 507057707996268 in words is "five hundred seven trillion, fifty-seven billion, seven hundred seven million, nine hundred ninety-six thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •