Base | Representation |
---|---|
bin | 1010000111011001111010… |
… | …1001111011111101111001 |
3 | 1110101021200110010102010211 |
4 | 2201312132221323331321 |
5 | 2424212014010414001 |
6 | 35353310121311121 |
7 | 2225363521110211 |
oct | 241663651737571 |
9 | 43337613112124 |
10 | 11122332123001 |
11 | 35a8a55585610 |
12 | 12b76ba6354a1 |
13 | 628aa681c958 |
14 | 2a647650d241 |
15 | 1444b6279351 |
hex | a1d9ea7bf79 |
11122332123001 has 8 divisors (see below), whose sum is σ = 12133477785600. Its totient is φ = 10111190553840.
The previous prime is 11122332122969. The next prime is 11122332123031. The reversal of 11122332123001 is 10032123322111.
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 11122332123001 - 25 = 11122332122969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11122332123031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8559240 + ... + 9772678.
It is an arithmetic number, because the mean of its divisors is an integer number (1516684723200).
Almost surely, 211122332123001 is an apocalyptic number.
11122332123001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11122332123001 is a deficient number, since it is larger than the sum of its proper divisors (1011145662599).
11122332123001 is a wasteful number, since it uses less digits than its factorization.
11122332123001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2046719.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11122332123001 its reverse (10032123322111), we get a palindrome (21154455445112).
The spelling of 11122332123001 in words is "eleven trillion, one hundred twenty-two billion, three hundred thirty-two million, one hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •