Base | Representation |
---|---|
bin | 100001001010100… |
… | …001011101101010 |
3 | 1102202222101102010 |
4 | 201022201131222 |
5 | 2114420003014 |
6 | 131113420350 |
7 | 16534243530 |
oct | 4112413552 |
9 | 1382871363 |
10 | 556406634 |
11 | 2660935a3 |
12 | 13640a6b6 |
13 | 8b3745c4 |
14 | 53c7a150 |
15 | 33cab359 |
hex | 212a176a |
556406634 has 64 divisors (see below), whose sum is σ = 1359369216. Its totient is φ = 148203264.
The previous prime is 556406597. The next prime is 556406687. The reversal of 556406634 is 436604655.
It is a junction number, because it is equal to n+sod(n) for n = 556406592 and 556406601.
It is an unprimeable number.
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, 72757 + ... + 80039.
It is an arithmetic number, because the mean of its divisors is an integer number (21240144).
Almost surely, 2556406634 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 556406634, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (679684608).
556406634 is an abundant number, since it is smaller than the sum of its proper divisors (802962582).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556406634 is a wasteful number, since it uses less digits than its factorization.
556406634 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7419.
The product of its (nonzero) digits is 259200, while the sum is 39.
The square root of 556406634 is about 23588.2732305695. The cubic root of 556406634 is about 822.4902652494.
It can be divided in two parts, 556406 and 634, that added together give a triangular number (557040 = T1055).
The spelling of 556406634 in words is "five hundred fifty-six million, four hundred six thousand, six hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •