Base | Representation |
---|---|
bin | 10011101010010001… |
… | …10100010001011111 |
3 | 1000020121102201002022 |
4 | 21311020310101133 |
5 | 133104111231002 |
6 | 4503214050355 |
7 | 522365356622 |
oct | 116510642137 |
9 | 30217381068 |
10 | 10555180127 |
11 | 4527140068 |
12 | 2066aa99bb |
13 | cc2a2271b |
14 | 721b9ddb9 |
15 | 41b9c5ba2 |
hex | 27523445f |
10555180127 has 4 divisors (see below), whose sum is σ = 10560234960. Its totient is φ = 10550125296.
The previous prime is 10555180123. The next prime is 10555180159. The reversal of 10555180127 is 72108155501.
10555180127 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10555180127 - 22 = 10555180123 is a prime.
It is a super-2 number, since 2×105551801272 (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 (10555180123) 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 3 ways as a sum of consecutive naturals, for example, 2524283 + ... + 2528460.
It is an arithmetic number, because the mean of its divisors is an integer number (2640058740).
Almost surely, 210555180127 is an apocalyptic number.
10555180127 is a deficient number, since it is larger than the sum of its proper divisors (5054833).
10555180127 is an equidigital number, since it uses as much as digits as its factorization.
10555180127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5054832.
The product of its (nonzero) digits is 14000, while the sum is 35.
The spelling of 10555180127 in words is "ten billion, five hundred fifty-five million, one hundred eighty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •