Base | Representation |
---|---|
bin | 100110100101000001011… |
… | …0000011011000011111101 |
3 | 200202212212021110002201210 |
4 | 1031022002300123003331 |
5 | 1143332332421000401 |
6 | 15135442302555033 |
7 | 1055033022032544 |
oct | 115120260330375 |
9 | 20685767402653 |
10 | 5302183375101 |
11 | 1764709318898 |
12 | 717722598a79 |
13 | 2c5cbc3533b2 |
14 | 1448ac87915b |
15 | 92dc69164d6 |
hex | 4d282c1b0fd |
5302183375101 has 8 divisors (see below), whose sum is σ = 7079410350720. Its totient is φ = 3529872658112.
The previous prime is 5302183374991. The next prime is 5302183375129. The reversal of 5302183375101 is 1015733812035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5302183375101 - 29 = 5302183374589 is a prime.
It is a super-2 number, since 2×53021833751012 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5302183375101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5302183370101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1229062140 + ... + 1229066453.
It is an arithmetic number, because the mean of its divisors is an integer number (884926293840).
Almost surely, 25302183375101 is an apocalyptic number.
It is an amenable number.
5302183375101 is a deficient number, since it is larger than the sum of its proper divisors (1777226975619).
5302183375101 is a wasteful number, since it uses less digits than its factorization.
5302183375101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2458129315.
The product of its (nonzero) digits is 75600, while the sum is 39.
The spelling of 5302183375101 in words is "five trillion, three hundred two billion, one hundred eighty-three million, three hundred seventy-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •