Base | Representation |
---|---|
bin | 100100110001001000001… |
… | …1001000101000011100001 |
3 | 122220002110110001120221100 |
4 | 1021202100121011003201 |
5 | 1130243131313033010 |
6 | 14425242242545013 |
7 | 1031042404366500 |
oct | 111422031050341 |
9 | 18802413046840 |
10 | 5053304033505 |
11 | 1679104429912 |
12 | 697445368169 |
13 | 2a86a84c91b0 |
14 | 13681cc22837 |
15 | 8b6ac1b42c0 |
hex | 498906450e1 |
5053304033505 has 144 divisors (see below), whose sum is σ = 10996414438464. Its totient is φ = 2127811472640.
The previous prime is 5053304033387. The next prime is 5053304033509.
5053304033505 is a `hidden beast` number, since 5 + 0 + 53 + 30 + 40 + 33 + 505 = 666.
5053304033505 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5053304033505 - 27 = 5053304033377 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5053304033505.
It is not an unprimeable number, because it can be changed into a prime (5053304033509) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 13197810 + ... + 13575300.
It is an arithmetic number, because the mean of its divisors is an integer number (76363989156).
Almost surely, 25053304033505 is an apocalyptic number.
It is an amenable number.
5053304033505 is an abundant number, since it is smaller than the sum of its proper divisors (5943110404959).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5053304033505 is a wasteful number, since it uses less digits than its factorization.
5053304033505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377996 (or 377986 counting only the distinct ones).
The product of its (nonzero) digits is 202500, while the sum is 36.
The spelling of 5053304033505 in words is "five trillion, fifty-three billion, three hundred four million, thirty-three thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •