Base | Representation |
---|---|
bin | 10011101001101101… |
… | …11111000000011101 |
3 | 1000020021122012201000 |
4 | 21310312333000131 |
5 | 133101412134001 |
6 | 4502525540513 |
7 | 522310550154 |
oct | 116466770035 |
9 | 30207565630 |
10 | 10550505501 |
11 | 4524537a38 |
12 | 2065414739 |
13 | cc1a76a83 |
14 | 72130459b |
15 | 41b3a0a86 |
hex | 274dbf01d |
10550505501 has 16 divisors (see below), whose sum is σ = 15633329920. Its totient is φ = 7032342240.
The previous prime is 10550505491. The next prime is 10550505503.
10550505501 is a `hidden beast` number, since 10 + 5 + 50 + 50 + 550 + 1 = 666.
10550505501 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 10550505501 - 221 = 10548408349 is a prime.
It is a super-2 number, since 2×105505055012 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10550505503) 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 15 ways as a sum of consecutive naturals, for example, 121041 + ... + 189081.
It is an arithmetic number, because the mean of its divisors is an integer number (977083120).
Almost surely, 210550505501 is an apocalyptic number.
It is an amenable number.
10550505501 is a deficient number, since it is larger than the sum of its proper divisors (5082824419).
10550505501 is an equidigital number, since it uses as much as digits as its factorization.
10550505501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73793 (or 73787 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 27.
The spelling of 10550505501 in words is "ten billion, five hundred fifty million, five hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •