Base | Representation |
---|---|
bin | 10100100100000100… |
… | …10011101101010101 |
3 | 1001111101201202221121 |
4 | 22102002103231111 |
5 | 140102220410031 |
6 | 5023253443541 |
7 | 540403364143 |
oct | 122202235525 |
9 | 31441652847 |
10 | 11040013141 |
11 | 4755888303 |
12 | 21813405b1 |
13 | 106c2c7171 |
14 | 76a328593 |
15 | 449345011 |
hex | 292093b55 |
11040013141 has 2 divisors, whose sum is σ = 11040013142. Its totient is φ = 11040013140.
The previous prime is 11040013123. The next prime is 11040013157. The reversal of 11040013141 is 14131004011.
It is an a-pointer prime, because the next prime (11040013157) can be obtained adding 11040013141 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6875892241 + 4164120900 = 82921^2 + 64530^2 .
It is a cyclic number.
It is not a de Polignac number, because 11040013141 - 27 = 11040013013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11040013241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5520006570 + 5520006571.
It is an arithmetic number, because the mean of its divisors is an integer number (5520006571).
Almost surely, 211040013141 is an apocalyptic number.
It is an amenable number.
11040013141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11040013141 is an equidigital number, since it uses as much as digits as its factorization.
11040013141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11040013141 its reverse (14131004011), we get a palindrome (25171017152).
The spelling of 11040013141 in words is "eleven billion, forty million, thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •