Base | Representation |
---|---|
bin | 1010001000100011101011… |
… | …1001000101101110011011 |
3 | 1110110011210102100212001210 |
4 | 2202020322321011232123 |
5 | 2430023042100210021 |
6 | 35410343023314203 |
7 | 2226664306424646 |
oct | 242107271055633 |
9 | 43404712325053 |
10 | 11142133210011 |
11 | 36063967a4331 |
12 | 12bb505a4b963 |
13 | 62a910c30c9b |
14 | 2a73d4216a5d |
15 | 144c74802e76 |
hex | a223ae45b9b |
11142133210011 has 16 divisors (see below), whose sum is σ = 15201988015104. Its totient is φ = 7255190830944.
The previous prime is 11142133210003. The next prime is 11142133210031. The reversal of 11142133210011 is 11001233124111.
It is a happy number.
11142133210011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11142133210011 - 23 = 11142133210003 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11142133210011.
It is not an unprimeable number, because it can be changed into a prime (11142133210031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5462710 + ... + 7219796.
It is an arithmetic number, because the mean of its divisors is an integer number (950124250944).
Almost surely, 211142133210011 is an apocalyptic number.
11142133210011 is a deficient number, since it is larger than the sum of its proper divisors (4059854805093).
11142133210011 is a wasteful number, since it uses less digits than its factorization.
11142133210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1806290.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 11142133210011 its reverse (11001233124111), we get a palindrome (22143366334122).
The spelling of 11142133210011 in words is "eleven trillion, one hundred forty-two billion, one hundred thirty-three million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •