Base | Representation |
---|---|
bin | 1001011001011101… |
… | …11000011010111000 |
3 | 111000121220122102221 |
4 | 10230232320122320 |
5 | 40313114021040 |
6 | 2152353333424 |
7 | 236013440641 |
oct | 45456703270 |
9 | 14017818387 |
10 | 5045454520 |
11 | 215a033727 |
12 | b89867274 |
13 | 6253b5062 |
14 | 35c1346c8 |
15 | 1e7e3474a |
hex | 12cbb86b8 |
5045454520 has 64 divisors (see below), whose sum is σ = 11541515040. Its totient is φ = 1984819200.
The previous prime is 5045454517. The next prime is 5045454523. The reversal of 5045454520 is 254545405.
It is an interprime number because it is at equal distance from previous prime (5045454517) and next prime (5045454523).
It is a super-2 number, since 2×50454545202 = 50913222626776860800, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5045454523) 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 15 ways as a sum of consecutive naturals, for example, 587860 + ... + 596380.
Almost surely, 25045454520 is an apocalyptic number.
It is an amenable number.
5045454520 is an abundant number, since it is smaller than the sum of its proper divisors (6496060520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5045454520 is a wasteful number, since it uses less digits than its factorization.
5045454520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8776 (or 8772 counting only the distinct ones).
The product of its (nonzero) digits is 80000, while the sum is 34.
The square root of 5045454520 is about 71031.3629321584. The cubic root of 5045454520 is about 1715.1420656538.
Adding to 5045454520 its reverse (254545405), we get a palindrome (5299999925).
The spelling of 5045454520 in words is "five billion, forty-five million, four hundred fifty-four thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •