Base | Representation |
---|---|
bin | 1010010100101011… |
… | …00001001000101001 |
3 | 112022020110222011201 |
4 | 11022111201020221 |
5 | 42322240401100 |
6 | 2313534524201 |
7 | 254224155106 |
oct | 51225411051 |
9 | 15266428151 |
10 | 5542122025 |
11 | 2394424340 |
12 | 10a8066661 |
13 | 6a427135b |
14 | 3a809daad |
15 | 22684036a |
hex | 14a561229 |
5542122025 has 24 divisors (see below), whose sum is σ = 7554257568. Its totient is φ = 3999840000.
The previous prime is 5542122011. The next prime is 5542122029. The reversal of 5542122025 is 5202212455.
It is not a de Polignac number, because 5542122025 - 25 = 5542121993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5542121984 and 5542122002.
It is not an unprimeable number, because it can be changed into a prime (5542122029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40896 + ... + 112945.
It is an arithmetic number, because the mean of its divisors is an integer number (314760732).
Almost surely, 25542122025 is an apocalyptic number.
5542122025 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5542122025 is a deficient number, since it is larger than the sum of its proper divisors (2012135543).
5542122025 is a wasteful number, since it uses less digits than its factorization.
5542122025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153993 (or 153988 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 28.
The square root of 5542122025 is about 74445.4298462975. The cubic root of 5542122025 is about 1769.6689375177.
The spelling of 5542122025 in words is "five billion, five hundred forty-two million, one hundred twenty-two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •