Base | Representation |
---|---|
bin | 101110011000101… |
… | …0010000110001100 |
3 | 11000110200111001020 |
4 | 1130301102012030 |
5 | 11141421014202 |
6 | 414235314140 |
7 | 53366243352 |
oct | 13461220614 |
9 | 4013614036 |
10 | 1556423052 |
11 | 729618748 |
12 | 3752ab950 |
13 | 1ba5b90b2 |
14 | 10a9cd7d2 |
15 | 919925bc |
hex | 5cc5218c |
1556423052 has 48 divisors (see below), whose sum is σ = 3719595264. Its totient is φ = 506376000.
The previous prime is 1556423051. The next prime is 1556423053. The reversal of 1556423052 is 2503246551.
It is an interprime number because it is at equal distance from previous prime (1556423051) and next prime (1556423053).
It is not an unprimeable number, because it can be changed into a prime (1556423051) 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 15 ways as a sum of consecutive naturals, for example, 87777 + ... + 104007.
It is an arithmetic number, because the mean of its divisors is an integer number (77491568).
Almost surely, 21556423052 is an apocalyptic number.
1556423052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1556423052 is an abundant number, since it is smaller than the sum of its proper divisors (2163172212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1556423052 is a wasteful number, since it uses less digits than its factorization.
1556423052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16430 (or 16428 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 33.
The square root of 1556423052 is about 39451.5278791582. The cubic root of 1556423052 is about 1158.8908968942.
The spelling of 1556423052 in words is "one billion, five hundred fifty-six million, four hundred twenty-three thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •