Base | Representation |
---|---|
bin | 10011101010101100… |
… | …00100101010011101 |
3 | 1000020211222020220020 |
4 | 21311112010222131 |
5 | 133111003431013 |
6 | 4503420342353 |
7 | 522440042055 |
oct | 116526045235 |
9 | 30224866806 |
10 | 10558655133 |
11 | 45290a3974 |
12 | 20680a49b9 |
13 | cc366b340 |
14 | 722426565 |
15 | 41be60623 |
hex | 275584a9d |
10558655133 has 32 divisors (see below), whose sum is σ = 15232121856. Its totient is φ = 6467309568.
The previous prime is 10558655123. The next prime is 10558655189. The reversal of 10558655133 is 33155685501.
10558655133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10558655133 - 216 = 10558589597 is a prime.
It is a super-2 number, since 2×105586551332 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10558655113) 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 31 ways as a sum of consecutive naturals, for example, 13658935 + ... + 13659707.
It is an arithmetic number, because the mean of its divisors is an integer number (476003808).
Almost surely, 210558655133 is an apocalyptic number.
10558655133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10558655133 is a deficient number, since it is larger than the sum of its proper divisors (4673466723).
10558655133 is a wasteful number, since it uses less digits than its factorization.
10558655133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1973.
The product of its (nonzero) digits is 270000, while the sum is 42.
The spelling of 10558655133 in words is "ten billion, five hundred fifty-eight million, six hundred fifty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •