Base | Representation |
---|---|
bin | 100001001001010… |
… | …111011101101100 |
3 | 1102202101222122010 |
4 | 201021113131230 |
5 | 2114330303112 |
6 | 131103121220 |
7 | 16531542045 |
oct | 4111273554 |
9 | 1382358563 |
10 | 556103532 |
11 | 2659a68a6 |
12 | 1362a3210 |
13 | 8b29965a |
14 | 53bdb8cc |
15 | 33c4b63c |
hex | 2125776c |
556103532 has 12 divisors (see below), whose sum is σ = 1297574936. Its totient is φ = 185367840.
The previous prime is 556103521. The next prime is 556103543. The reversal of 556103532 is 235301655.
556103532 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (556103521) and next prime (556103543).
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×5561035322 = 618502276605750048, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 556103532.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23170969 + ... + 23170992.
Almost surely, 2556103532 is an apocalyptic number.
It is an amenable number.
556103532 is an abundant number, since it is smaller than the sum of its proper divisors (741471404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556103532 is a wasteful number, since it uses less digits than its factorization.
556103532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46341968 (or 46341966 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 30.
The square root of 556103532 is about 23581.8475103203. The cubic root of 556103532 is about 822.3408878509.
The spelling of 556103532 in words is "five hundred fifty-six million, one hundred three thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •