Base | Representation |
---|---|
bin | 1001100001011110… |
… | …1001100110101000 |
3 | 20121011012100111120 |
4 | 2120113221212220 |
5 | 20213410232202 |
6 | 1101355055240 |
7 | 120230334150 |
oct | 23027514650 |
9 | 6534170446 |
10 | 2556336552 |
11 | 10a1a92540 |
12 | 5b4141520 |
13 | 3197c5aa3 |
14 | 1a3717760 |
15 | ee6580bc |
hex | 985e99a8 |
2556336552 has 128 divisors (see below), whose sum is σ = 8162380800. Its totient is φ = 647769600.
The previous prime is 2556336527. The next prime is 2556336569.
2556336552 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58899 + ... + 92637.
It is an arithmetic number, because the mean of its divisors is an integer number (63768600).
Almost surely, 22556336552 is an apocalyptic number.
2556336552 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2556336552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4081190400).
2556336552 is an abundant number, since it is smaller than the sum of its proper divisors (5606044248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2556336552 is a wasteful number, since it uses less digits than its factorization.
2556336552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33807 (or 33803 counting only the distinct ones).
The product of its digits is 810000, while the sum is 42.
The square root of 2556336552 is about 50560.2269773386. The cubic root of 2556336552 is about 1367.3279033274.
The spelling of 2556336552 in words is "two billion, five hundred fifty-six million, three hundred thirty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •