Base | Representation |
---|---|
bin | 10011101001110100… |
… | …00110101110011110 |
3 | 1000020100011202212010 |
4 | 21310322012232132 |
5 | 133102114323200 |
6 | 4502555252050 |
7 | 522320525145 |
oct | 116472065636 |
9 | 30210152763 |
10 | 10551323550 |
11 | 4524a46609 |
12 | 206574a026 |
13 | cc1ca2221 |
14 | 72147875c |
15 | 41b4b3150 |
hex | 274e86b9e |
10551323550 has 48 divisors (see below), whose sum is σ = 26426402352. Its totient is φ = 2785824000.
The previous prime is 10551323539. The next prime is 10551323551. The reversal of 10551323550 is 5532315501.
It is a super-2 number, since 2×105513235502 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10551323551) 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 23 ways as a sum of consecutive naturals, for example, 333079 + ... + 363378.
It is an arithmetic number, because the mean of its divisors is an integer number (550550049).
Almost surely, 210551323550 is an apocalyptic number.
10551323550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10551323550 is an abundant number, since it is smaller than the sum of its proper divisors (15875078802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10551323550 is a wasteful number, since it uses less digits than its factorization.
10551323550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696573 (or 696568 counting only the distinct ones).
The product of its (nonzero) digits is 11250, while the sum is 30.
The spelling of 10551323550 in words is "ten billion, five hundred fifty-one million, three hundred twenty-three thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •