Base | Representation |
---|---|
bin | 1010010001110111001111… |
… | …0000011001100010000111 |
3 | 1111000110102212212012201121 |
4 | 2210131303300121202013 |
5 | 2440132444230214421 |
6 | 40012022333334411 |
7 | 2244354056421421 |
oct | 244356360314207 |
9 | 44013385765647 |
10 | 11302001023111 |
11 | 3668173a31517 |
12 | 13264a1337407 |
13 | 63ca0a9978b6 |
14 | 2b103c35b811 |
15 | 148ece87dd41 |
hex | a4773c19887 |
11302001023111 has 8 divisors (see below), whose sum is σ = 11371804940160. Its totient is φ = 11232222430968.
The previous prime is 11302001023087. The next prime is 11302001023153. The reversal of 11302001023111 is 11132010020311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11302001023111 is a prime.
It is a super-2 number, since 2×113020010231112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11302001027111) 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, 5435521 + ... + 7221418.
It is an arithmetic number, because the mean of its divisors is an integer number (1421475617520).
Almost surely, 211302001023111 is an apocalyptic number.
11302001023111 is a deficient number, since it is larger than the sum of its proper divisors (69803917049).
11302001023111 is a wasteful number, since it uses less digits than its factorization.
11302001023111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12662453.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11302001023111 its reverse (11132010020311), we get a palindrome (22434011043422).
The spelling of 11302001023111 in words is "eleven trillion, three hundred two billion, one million, twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •