Base | Representation |
---|---|
bin | 10010101110101110… |
… | …00111001011110101 |
3 | 221221210101222020200 |
4 | 21113113013023311 |
5 | 131043214024000 |
6 | 4341450351113 |
7 | 504121166340 |
oct | 112727071365 |
9 | 27853358220 |
10 | 10055611125 |
11 | 42a014851a |
12 | 1b4772b499 |
13 | c4338b871 |
14 | 6b56bb457 |
15 | 3dcbe5500 |
hex | 2575c72f5 |
10055611125 has 48 divisors (see below), whose sum is σ = 20716490496. Its totient is φ = 4596847200.
The previous prime is 10055611123. The next prime is 10055611157. The reversal of 10055611125 is 52111655001.
10055611125 is a `hidden beast` number, since 100 + 556 + 1 + 1 + 1 + 2 + 5 = 666.
It is not a de Polignac number, because 10055611125 - 21 = 10055611123 is a prime.
It is a super-2 number, since 2×100556111252 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10055611121) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 630577 + ... + 646326.
It is an arithmetic number, because the mean of its divisors is an integer number (431593552).
Almost surely, 210055611125 is an apocalyptic number.
10055611125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10055611125 is an abundant number, since it is smaller than the sum of its proper divisors (10660879371).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10055611125 is a wasteful number, since it uses less digits than its factorization.
10055611125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1276931 (or 1276918 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 27.
The spelling of 10055611125 in words is "ten billion, fifty-five million, six hundred eleven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •