Base | Representation |
---|---|
bin | 10100100100000111… |
… | …00100000001101011 |
3 | 1001111102100111020010 |
4 | 22102003210001223 |
5 | 140102311421443 |
6 | 5023304503003 |
7 | 540406234236 |
oct | 122203440153 |
9 | 31442314203 |
10 | 11040342123 |
11 | 4755a92498 |
12 | 218147aa63 |
13 | 106c3b0b25 |
14 | 76a3b241d |
15 | 4493ac733 |
hex | 2920e406b |
11040342123 has 8 divisors (see below), whose sum is σ = 14724738000. Its totient is φ = 7358087168.
The previous prime is 11040342101. The next prime is 11040342223. The reversal of 11040342123 is 32124304011.
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 11040342123 - 26 = 11040342059 is a prime.
It is a super-3 number, since 3×110403421233 (a number of 31 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11040342123.
It is not an unprimeable number, because it can be changed into a prime (11040342223) 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, 523158 + ... + 543851.
It is an arithmetic number, because the mean of its divisors is an integer number (1840592250).
Almost surely, 211040342123 is an apocalyptic number.
11040342123 is a deficient number, since it is larger than the sum of its proper divisors (3684395877).
11040342123 is a wasteful number, since it uses less digits than its factorization.
11040342123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1070461.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 11040342123 its reverse (32124304011), we get a palindrome (43164646134).
The spelling of 11040342123 in words is "eleven billion, forty million, three hundred forty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •