Base | Representation |
---|---|
bin | 1001100001011011… |
… | …0011000110010100 |
3 | 20121010210000020222 |
4 | 2120112303012110 |
5 | 20213331111200 |
6 | 1101350213512 |
7 | 120225414236 |
oct | 23026630624 |
9 | 6533700228 |
10 | 2556113300 |
11 | 10a194a834 |
12 | 5b4054298 |
13 | 3197482a0 |
14 | 1a369a256 |
15 | ee611d85 |
hex | 985b3194 |
2556113300 has 36 divisors (see below), whose sum is σ = 5973443196. Its totient is φ = 943795200.
The previous prime is 2556113281. The next prime is 2556113311. The reversal of 2556113300 is 33116552.
It can be written as a sum of positive squares in 6 ways, for example, as 1936 + 2556111364 = 44^2 + 50558^2 .
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a self number, because there is not a number n which added to its sum of digits gives 2556113300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 981821 + ... + 984420.
Almost surely, 22556113300 is an apocalyptic number.
2556113300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2556113300 is an abundant number, since it is smaller than the sum of its proper divisors (3417329896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2556113300 is a wasteful number, since it uses less digits than its factorization.
2556113300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1966268 (or 1966261 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 2556113300 is about 50558.0191463234. The cubic root of 2556113300 is about 1367.2880979823.
Adding to 2556113300 its reverse (33116552), we get a palindrome (2589229852).
The spelling of 2556113300 in words is "two billion, five hundred fifty-six million, one hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •