Base | Representation |
---|---|
bin | 10100100000100000… |
… | …10010110101010101 |
3 | 1001102022111022022122 |
4 | 22100100102311111 |
5 | 140022043001031 |
6 | 5020305105325 |
7 | 536561343131 |
oct | 122020226525 |
9 | 31368438278 |
10 | 11010125141 |
11 | 473aa23a84 |
12 | 2173328245 |
13 | 1066061162 |
14 | 7663883c1 |
15 | 4468de47b |
hex | 290412d55 |
11010125141 has 8 divisors (see below), whose sum is σ = 11085465600. Its totient is φ = 10934938720.
The previous prime is 11010125099. The next prime is 11010125153. The reversal of 11010125141 is 14152101011.
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 11010125141 - 214 = 11010108757 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010125171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 106796 + ... + 182826.
It is an arithmetic number, because the mean of its divisors is an integer number (1385683200).
Almost surely, 211010125141 is an apocalyptic number.
It is an amenable number.
11010125141 is a deficient number, since it is larger than the sum of its proper divisors (75340459).
11010125141 is an equidigital number, since it uses as much as digits as its factorization.
11010125141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77019.
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 11010125141 its reverse (14152101011), we get a palindrome (25162226152).
The spelling of 11010125141 in words is "eleven billion, ten million, one hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •