Base | Representation |
---|---|
bin | 10100011001111111… |
… | …11100001111100000 |
3 | 1001021111201101211210 |
4 | 22030333330033200 |
5 | 134414102203111 |
6 | 5011034310120 |
7 | 535326161433 |
oct | 121477741740 |
9 | 31244641753 |
10 | 10955506656 |
11 | 4712109336 |
12 | 2158b88340 |
13 | 1057949823 |
14 | 75d00b81a |
15 | 441c010a6 |
hex | 28cffc3e0 |
10955506656 has 48 divisors (see below), whose sum is σ = 30449868624. Its totient is φ = 3437021184.
The previous prime is 10955506631. The next prime is 10955506657. The reversal of 10955506656 is 65660555901.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10955506657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3354835 + ... + 3358098.
It is an arithmetic number, because the mean of its divisors is an integer number (634372263).
Almost surely, 210955506656 is an apocalyptic number.
10955506656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10955506656 is an abundant number, since it is smaller than the sum of its proper divisors (19494361968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10955506656 is a wasteful number, since it uses less digits than its factorization.
10955506656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6712963 (or 6712955 counting only the distinct ones).
The product of its (nonzero) digits is 1215000, while the sum is 48.
The spelling of 10955506656 in words is "ten billion, nine hundred fifty-five million, five hundred six thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •