Base | Representation |
---|---|
bin | 1010000111111110010110… |
… | …0010101001111011001110 |
3 | 1110102012220222102122121111 |
4 | 2201333211202221323032 |
5 | 2424342031000043042 |
6 | 35402004335522234 |
7 | 2226161045026603 |
oct | 241774542517316 |
9 | 43365828378544 |
10 | 11132111331022 |
11 | 36021136a6310 |
12 | 12b958968937a |
13 | 6299a4853086 |
14 | 2a6b231da6aa |
15 | 144889a72517 |
hex | a1fe58a9ece |
11132111331022 has 8 divisors (see below), whose sum is σ = 18216182178072. Its totient is φ = 5060050605000.
The previous prime is 11132111330957. The next prime is 11132111331037. The reversal of 11132111331022 is 22013311123111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 506005060501 = 11132111331022 / (1 + 1 + 1 + 3 + 2 + 1 + 1 + 1 + 3 + 3 + 1 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 11132111330984 and 11132111331002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 253002530229 + ... + 253002530272.
It is an arithmetic number, because the mean of its divisors is an integer number (2277022772259).
Almost surely, 211132111331022 is an apocalyptic number.
11132111331022 is a deficient number, since it is larger than the sum of its proper divisors (7084070847050).
11132111331022 is a wasteful number, since it uses less digits than its factorization.
11132111331022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506005060514.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 11132111331022 its reverse (22013311123111), we get a palindrome (33145422454133).
The spelling of 11132111331022 in words is "eleven trillion, one hundred thirty-two billion, one hundred eleven million, three hundred thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •