Base | Representation |
---|---|
bin | 100110100110000110100… |
… | …0110000011100111011000 |
3 | 200210002212000200101221210 |
4 | 1031030031012003213120 |
5 | 1143402111100131130 |
6 | 15140504452303120 |
7 | 1055144363423436 |
oct | 115141506034730 |
9 | 20702760611853 |
10 | 5304504302040 |
11 | 176569a432629 |
12 | 71806b911aa0 |
13 | 2c629c144848 |
14 | 144a4cbd3d56 |
15 | 92eb056d5b0 |
hex | 4d30d1839d8 |
5304504302040 has 64 divisors (see below), whose sum is σ = 15913677542400. Its totient is φ = 1414519846272.
The previous prime is 5304504301981. The next prime is 5304504302101. The reversal of 5304504302040 is 402034054035.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 5304504301989 and 5304504302007.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16492281 + ... + 16810839.
It is an arithmetic number, because the mean of its divisors is an integer number (248651211600).
Almost surely, 25304504302040 is an apocalyptic number.
It is an amenable number.
5304504302040 is an abundant number, since it is smaller than the sum of its proper divisors (10609173240360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5304504302040 is a wasteful number, since it uses less digits than its factorization.
5304504302040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457336 (or 457332 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 30.
Adding to 5304504302040 its reverse (402034054035), we get a palindrome (5706538356075).
The spelling of 5304504302040 in words is "five trillion, three hundred four billion, five hundred four million, three hundred two thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •