Base | Representation |
---|---|
bin | 1001111000000011… |
… | …01100111101001101 |
3 | 111200111201212112010 |
4 | 10330001230331031 |
5 | 41324310442131 |
6 | 2234041131433 |
7 | 245250436431 |
oct | 47401547515 |
9 | 14614655463 |
10 | 5302046541 |
11 | 228095a050 |
12 | 103b789b79 |
13 | 6665c505c |
14 | 3842489c1 |
15 | 21071bb46 |
hex | 13c06cf4d |
5302046541 has 32 divisors (see below), whose sum is σ = 7879504896. Its totient is φ = 3144240000.
The previous prime is 5302046537. The next prime is 5302046543. The reversal of 5302046541 is 1456402035.
It is not a de Polignac number, because 5302046541 - 22 = 5302046537 is a prime.
It is a super-2 number, since 2×53020465412 = 56223395045860129362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5302046499 and 5302046508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5302046543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 325921 + ... + 341801.
It is an arithmetic number, because the mean of its divisors is an integer number (246234528).
Almost surely, 25302046541 is an apocalyptic number.
It is an amenable number.
5302046541 is a deficient number, since it is larger than the sum of its proper divisors (2577458355).
5302046541 is a wasteful number, since it uses less digits than its factorization.
5302046541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16113.
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 5302046541 is about 72815.1532374958. The cubic root of 5302046541 is about 1743.7377856983.
Adding to 5302046541 its reverse (1456402035), we get a palindrome (6758448576).
The spelling of 5302046541 in words is "five billion, three hundred two million, forty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •