Base | Representation |
---|---|
bin | 10100111011001111… |
… | …00101000111010101 |
3 | 1001222221101020212122 |
4 | 22131213211013111 |
5 | 141001442130031 |
6 | 5054434425325 |
7 | 545253153563 |
oct | 123547450725 |
9 | 31887336778 |
10 | 11234333141 |
11 | 4845540849 |
12 | 2216432245 |
13 | 10a0643005 |
14 | 78806ca33 |
15 | 45b42b47b |
hex | 29d9e51d5 |
11234333141 has 16 divisors (see below), whose sum is σ = 11821420800. Its totient is φ = 10655715840.
The previous prime is 11234333137. The next prime is 11234333147. The reversal of 11234333141 is 14133343211.
It is a cyclic number.
It is not a de Polignac number, because 11234333141 - 22 = 11234333137 is a prime.
It is a super-2 number, since 2×112343331412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11234333141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11234333147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2303936 + ... + 2308806.
It is an arithmetic number, because the mean of its divisors is an integer number (738838800).
Almost surely, 211234333141 is an apocalyptic number.
It is an amenable number.
11234333141 is a deficient number, since it is larger than the sum of its proper divisors (587087659).
11234333141 is a wasteful number, since it uses less digits than its factorization.
11234333141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5716.
The product of its digits is 2592, while the sum is 26.
Adding to 11234333141 its reverse (14133343211), we get a palindrome (25367676352).
The spelling of 11234333141 in words is "eleven billion, two hundred thirty-four million, three hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •