Base | Representation |
---|---|
bin | 1010010000001001… |
… | …11011110101101011 |
3 | 112012121011101002101 |
4 | 11020010323311223 |
5 | 42233040024043 |
6 | 2310102314231 |
7 | 253254050104 |
oct | 51004736553 |
9 | 15177141071 |
10 | 5504220523 |
11 | 2374a9738a |
12 | 1097428977 |
13 | 699460a29 |
14 | 3a30353ab |
15 | 22335524d |
hex | 14813bd6b |
5504220523 has 8 divisors (see below), whose sum is σ = 5795726400. Its totient is φ = 5212895688.
The previous prime is 5504220517. The next prime is 5504220571. The reversal of 5504220523 is 3250224055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5504220523 - 213 = 5504212331 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5504220491 and 5504220500.
It is not an unprimeable number, because it can be changed into a prime (5504220583) 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 7 ways as a sum of consecutive naturals, for example, 19548 + ... + 106726.
It is an arithmetic number, because the mean of its divisors is an integer number (724465800).
Almost surely, 25504220523 is an apocalyptic number.
5504220523 is a deficient number, since it is larger than the sum of its proper divisors (291505877).
5504220523 is a wasteful number, since it uses less digits than its factorization.
5504220523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90521.
The product of its (nonzero) digits is 12000, while the sum is 28.
The square root of 5504220523 is about 74190.4341744945. The cubic root of 5504220523 is about 1765.6255648367.
Adding to 5504220523 its reverse (3250224055), we get a palindrome (8754444578).
The spelling of 5504220523 in words is "five billion, five hundred four million, two hundred twenty thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •