Base | Representation |
---|---|
bin | 1001100010011100… |
… | …10011110011111101 |
3 | 111012212200200211000 |
4 | 10301032103303331 |
5 | 40441411131140 |
6 | 2204044320513 |
7 | 240620046012 |
oct | 46116236375 |
9 | 14185620730 |
10 | 5120802045 |
11 | 2198617407 |
12 | baab43139 |
13 | 637ba68a8 |
14 | 368149709 |
15 | 1ee869a30 |
hex | 131393cfd |
5120802045 has 64 divisors (see below), whose sum is σ = 9455616000. Its totient is φ = 2627489088.
The previous prime is 5120802023. The next prime is 5120802047. The reversal of 5120802045 is 5402080215.
It is a happy number.
It is not a de Polignac number, because 5120802045 - 211 = 5120799997 is a prime.
It is a super-2 number, since 2×51208020452 = 52445227168152364050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5120802047) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 367516 + ... + 381194.
It is an arithmetic number, because the mean of its divisors is an integer number (147744000).
Almost surely, 25120802045 is an apocalyptic number.
It is an amenable number.
5120802045 is a deficient number, since it is larger than the sum of its proper divisors (4334813955).
5120802045 is a wasteful number, since it uses less digits than its factorization.
5120802045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13799 (or 13793 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
The square root of 5120802045 is about 71559.7795203423. The cubic root of 5120802045 is about 1723.6377449084.
The spelling of 5120802045 in words is "five billion, one hundred twenty million, eight hundred two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •