Base | Representation |
---|---|
bin | 100110100101001010111… |
… | …1100101010111110111001 |
3 | 200202220200201022021120112 |
4 | 1031022111330222332321 |
5 | 1143334012332300040 |
6 | 15135534244034105 |
7 | 1055044011560210 |
oct | 115122574527671 |
9 | 20686621267515 |
10 | 5302505353145 |
11 | 1764864043750 |
12 | 7177b2392935 |
13 | 2c6040c77a50 |
14 | 1448dd530077 |
15 | 92de4d17365 |
hex | 4d295f2afb9 |
5302505353145 has 64 divisors (see below), whose sum is σ = 8555530314240. Its totient is φ = 3046837248000.
The previous prime is 5302505353139. The next prime is 5302505353163. The reversal of 5302505353145 is 5413535052035.
It is not a de Polignac number, because 5302505353145 - 212 = 5302505349049 is a prime.
It is a super-2 number, since 2×53025053531452 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2752841 + ... + 4264169.
It is an arithmetic number, because the mean of its divisors is an integer number (133680161160).
Almost surely, 25302505353145 is an apocalyptic number.
5302505353145 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5302505353145 is a deficient number, since it is larger than the sum of its proper divisors (3253024961095).
5302505353145 is a wasteful number, since it uses less digits than its factorization.
5302505353145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1512066.
The product of its (nonzero) digits is 675000, while the sum is 41.
The spelling of 5302505353145 in words is "five trillion, three hundred two billion, five hundred five million, three hundred fifty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •