Base | Representation |
---|---|
bin | 1100001101100010… |
… | …01010000010010011 |
3 | 121220220021022211202 |
4 | 12012301022002103 |
5 | 101411314003103 |
6 | 3002313501415 |
7 | 321315040541 |
oct | 60661120223 |
9 | 17826238752 |
10 | 6556000403 |
11 | 2864767157 |
12 | 132b71186b |
13 | 80632a4a4 |
14 | 4629c0d91 |
15 | 285863988 |
hex | 186c4a093 |
6556000403 has 4 divisors (see below), whose sum is σ = 6564331560. Its totient is φ = 6547669248.
The previous prime is 6556000397. The next prime is 6556000433. The reversal of 6556000403 is 3040006556.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6556000403 is a prime.
It is a super-2 number, since 2×65560004032 = 85962282568272324818, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6556000433) 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 3 ways as a sum of consecutive naturals, for example, 4164398 + ... + 4165971.
It is an arithmetic number, because the mean of its divisors is an integer number (1641082890).
Almost surely, 26556000403 is an apocalyptic number.
6556000403 is a deficient number, since it is larger than the sum of its proper divisors (8331157).
6556000403 is an equidigital number, since it uses as much as digits as its factorization.
6556000403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8331156.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 6556000403 is about 80969.1324085914. The cubic root of 6556000403 is about 1871.5998018114.
Adding to 6556000403 its reverse (3040006556), we get a palindrome (9596006959).
The spelling of 6556000403 in words is "six billion, five hundred fifty-six million, four hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.295 sec. • engine limits •