Base | Representation |
---|---|
bin | 1010010000000101… |
… | …11000001011001011 |
3 | 112012120010222022110 |
4 | 11020002320023023 |
5 | 42232420244402 |
6 | 2310042553403 |
7 | 253246342602 |
oct | 51002701313 |
9 | 15176128273 |
10 | 5503681227 |
11 | 2374759190 |
12 | 1097208863 |
13 | 699302415 |
14 | 3a2d34a39 |
15 | 22329a56c |
hex | 1480b82cb |
5503681227 has 32 divisors (see below), whose sum is σ = 8545443840. Its totient is φ = 3115476000.
The previous prime is 5503681081. The next prime is 5503681237. The reversal of 5503681227 is 7221863055.
It is not a de Polignac number, because 5503681227 - 220 = 5502632651 is a prime.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (5503681237) 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 31 ways as a sum of consecutive naturals, for example, 17299 + ... + 106332.
It is an arithmetic number, because the mean of its divisors is an integer number (267045120).
Almost surely, 25503681227 is an apocalyptic number.
5503681227 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
5503681227 is a deficient number, since it is larger than the sum of its proper divisors (3041762613).
5503681227 is a wasteful number, since it uses less digits than its factorization.
5503681227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123735.
The product of its (nonzero) digits is 100800, while the sum is 39.
The square root of 5503681227 is about 74186.7995468196. The cubic root of 5503681227 is about 1765.5678984272.
The spelling of 5503681227 in words is "five billion, five hundred three million, six hundred eighty-one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •