Base | Representation |
---|---|
bin | 1001111000010010… |
… | …01100100101101011 |
3 | 111200122102200102010 |
4 | 10330021030211223 |
5 | 41330311323430 |
6 | 2234151211003 |
7 | 245303231154 |
oct | 47411144553 |
9 | 14618380363 |
10 | 5304011115 |
11 | 2281a81067 |
12 | 1040376a63 |
13 | 666b32320 |
14 | 3845da92b |
15 | 2109a8cb0 |
hex | 13c24c96b |
5304011115 has 64 divisors (see below), whose sum is σ = 9596160000. Its totient is φ = 2483357184.
The previous prime is 5304011077. The next prime is 5304011131. The reversal of 5304011115 is 5111104035.
It is a happy number.
It is not a de Polignac number, because 5304011115 - 29 = 5304010603 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5304011091 and 5304011100.
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, 371886 + ... + 385884.
It is an arithmetic number, because the mean of its divisors is an integer number (149940000).
Almost surely, 25304011115 is an apocalyptic number.
5304011115 is a deficient number, since it is larger than the sum of its proper divisors (4292148885).
5304011115 is a wasteful number, since it uses less digits than its factorization.
5304011115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14116.
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 5304011115 is about 72828.6421334354. The cubic root of 5304011115 is about 1743.9531288912.
The spelling of 5304011115 in words is "five billion, three hundred four million, eleven thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •