Base | Representation |
---|---|
bin | 100110100110000110100… |
… | …0101000000000010010000 |
3 | 200210002212000011100020122 |
4 | 1031030031011000002100 |
5 | 1143402111012301412 |
6 | 15140504442325412 |
7 | 1055144361161426 |
oct | 115141505000220 |
9 | 20702760140218 |
10 | 5304504025232 |
11 | 176569a263665 |
12 | 71806b7b9868 |
13 | 2c629c078859 |
14 | 144a4cb61116 |
15 | 92eb0516572 |
hex | 4d30d140090 |
5304504025232 has 20 divisors (see below), whose sum is σ = 10609008051456. Its totient is φ = 2566695495840.
The previous prime is 5304504025207. The next prime is 5304504025279. The reversal of 5304504025232 is 2325204054035.
5304504025232 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 5304504025192 and 5304504025201.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5347281788 + ... + 5347282779.
Almost surely, 25304504025232 is an apocalyptic number.
It is an amenable number.
5304504025232 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5304504025232 is a wasteful number, since it uses less digits than its factorization.
5304504025232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10694564606 (or 10694564600 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 35.
Adding to 5304504025232 its reverse (2325204054035), we get a palindrome (7629708079267).
The spelling of 5304504025232 in words is "five trillion, three hundred four billion, five hundred four million, twenty-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •