Base | Representation |
---|---|
bin | 1001011010100011… |
… | …10001110011001101 |
3 | 111001021010102000222 |
4 | 10231101301303031 |
5 | 40322434234240 |
6 | 2153321401125 |
7 | 236154261164 |
oct | 45521616315 |
9 | 14037112028 |
10 | 5054602445 |
11 | 21642116a2 |
12 | b909391a5 |
13 | 627268b29 |
14 | 35d4363db |
15 | 1e8b3eeb5 |
hex | 12d471ccd |
5054602445 has 4 divisors (see below), whose sum is σ = 6065522940. Its totient is φ = 4043681952.
The previous prime is 5054602439. The next prime is 5054602457. The reversal of 5054602445 is 5442064505.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3987796201 + 1066806244 = 63149^2 + 32662^2 .
It is a cyclic number.
It is not a de Polignac number, because 5054602445 - 216 = 5054536909 is a prime.
It is a super-3 number, since 3×50546024453 (a number of 30 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 505460240 + ... + 505460249.
It is an arithmetic number, because the mean of its divisors is an integer number (1516380735).
Almost surely, 25054602445 is an apocalyptic number.
It is an amenable number.
5054602445 is a deficient number, since it is larger than the sum of its proper divisors (1010920495).
5054602445 is a wasteful number, since it uses less digits than its factorization.
5054602445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010920494.
The product of its (nonzero) digits is 96000, while the sum is 35.
The square root of 5054602445 is about 71095.7273329417. The cubic root of 5054602445 is about 1716.1780157972.
The spelling of 5054602445 in words is "five billion, fifty-four million, six hundred two thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •