Base | Representation |
---|---|
bin | 1010010011010000… |
… | …01110111100101110 |
3 | 112021102010212021010 |
4 | 11021220032330232 |
5 | 42311221013204 |
6 | 2312432250050 |
7 | 254021233626 |
oct | 51150167456 |
9 | 15242125233 |
10 | 5530251054 |
11 | 2388756519 |
12 | 10a40a0926 |
13 | 6a1976003 |
14 | 3a668d886 |
15 | 225797d89 |
hex | 149a0ef2e |
5530251054 has 32 divisors (see below), whose sum is σ = 11601874944. Its totient is φ = 1754028320.
The previous prime is 5530251049. The next prime is 5530251059. The reversal of 5530251054 is 4501520355.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (5530251049) and next prime (5530251059).
It is a super-2 number, since 2×55302510542 = 61167353440536221832, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5530251059) 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, 78549 + ... + 131264.
It is an arithmetic number, because the mean of its divisors is an integer number (362558592).
Almost surely, 25530251054 is an apocalyptic number.
5530251054 is an abundant number, since it is smaller than the sum of its proper divisors (6071623890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5530251054 is a wasteful number, since it uses less digits than its factorization.
5530251054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210032.
The product of its (nonzero) digits is 15000, while the sum is 30.
The square root of 5530251054 is about 74365.6577594793. The cubic root of 5530251054 is about 1768.4045177651.
The spelling of 5530251054 in words is "five billion, five hundred thirty million, two hundred fifty-one thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •