Base | Representation |
---|---|
bin | 10011101001101110… |
… | …01010001001000111 |
3 | 1000020021201112021021 |
4 | 21310313022021013 |
5 | 133101420113421 |
6 | 4502530532011 |
7 | 522311130142 |
oct | 116467121107 |
9 | 30207645237 |
10 | 10550551111 |
11 | 4524569231 |
12 | 2065437007 |
13 | cc1a91769 |
14 | 721317059 |
15 | 41b3ae341 |
hex | 274dca247 |
10550551111 has 8 divisors (see below), whose sum is σ = 10580112000. Its totient is φ = 10521024888.
The previous prime is 10550551091. The next prime is 10550551127. The reversal of 10550551111 is 11115505501.
10550551111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10550551111 - 227 = 10416333383 is a prime.
It is a super-2 number, since 2×105505511112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10550551181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 674400 + ... + 689866.
It is an arithmetic number, because the mean of its divisors is an integer number (1322514000).
Almost surely, 210550551111 is an apocalyptic number.
10550551111 is a deficient number, since it is larger than the sum of its proper divisors (29560889).
10550551111 is a wasteful number, since it uses less digits than its factorization.
10550551111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17333.
The product of its (nonzero) digits is 625, while the sum is 25.
The spelling of 10550551111 in words is "ten billion, five hundred fifty million, five hundred fifty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •