Base | Representation |
---|---|
bin | 10101100001000001… |
… | …010001110100010100 |
3 | 2012122001112201121000 |
4 | 111201001101310110 |
5 | 334303223432211 |
6 | 14340240023300 |
7 | 1445334350604 |
oct | 254101216424 |
9 | 65561481530 |
10 | 23102561556 |
11 | 9885880488 |
12 | 4589001b30 |
13 | 22423bb889 |
14 | 1192388c04 |
15 | 90331d656 |
hex | 561051d14 |
23102561556 has 48 divisors (see below), whose sum is σ = 59953801600. Its totient is φ = 7693361856.
The previous prime is 23102561513. The next prime is 23102561557. The reversal of 23102561556 is 65516520132.
23102561556 is a `hidden beast` number, since 2 + 3 + 10 + 25 + 615 + 5 + 6 = 666.
It is a super-2 number, since 2×231025615562 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 23102561556.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23102561557) 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, 8025 + ... + 215103.
Almost surely, 223102561556 is an apocalyptic number.
It is an amenable number.
23102561556 is an abundant number, since it is smaller than the sum of its proper divisors (36851240044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23102561556 is a wasteful number, since it uses less digits than its factorization.
23102561556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208125 (or 208117 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The spelling of 23102561556 in words is "twenty-three billion, one hundred two million, five hundred sixty-one thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •