Base | Representation |
---|---|
bin | 1010000111111110010011… |
… | …1111001001001101110001 |
3 | 1110102012220022220201000221 |
4 | 2201333210333021031301 |
5 | 2424342021104201001 |
6 | 35402003404213041 |
7 | 2226160602635602 |
oct | 241774477111561 |
9 | 43365808821027 |
10 | 11132102022001 |
11 | 3602109418304 |
12 | 12b958653a181 |
13 | 6299a2943b8c |
14 | 2a6b21c95da9 |
15 | 144888d341a1 |
hex | a1fe4fc9371 |
11132102022001 has 8 divisors (see below), whose sum is σ = 11290571181864. Its totient is φ = 10974578947200.
The previous prime is 11132102021993. The next prime is 11132102022011. The reversal of 11132102022001 is 10022020123111.
It can be written as a sum of positive squares in 4 ways, for example, as 245738318400 + 10886363703601 = 495720^2 + 3299449^2 .
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 11132102022001 - 23 = 11132102021993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11132102022011) 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, 236497566 + ... + 236544631.
It is an arithmetic number, because the mean of its divisors is an integer number (1411321397733).
Almost surely, 211132102022001 is an apocalyptic number.
It is an amenable number.
11132102022001 is a deficient number, since it is larger than the sum of its proper divisors (158469159863).
11132102022001 is a wasteful number, since it uses less digits than its factorization.
11132102022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473042531.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11132102022001 its reverse (10022020123111), we get a palindrome (21154122145112).
The spelling of 11132102022001 in words is "eleven trillion, one hundred thirty-two billion, one hundred two million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •