Base | Representation |
---|---|
bin | 1010010010111010101010… |
… | …0110011000001010000101 |
3 | 1111002012011022011220212012 |
4 | 2210232222212120022011 |
5 | 2440432031324341401 |
6 | 40024214351104005 |
7 | 2245564440661550 |
oct | 244565246301205 |
9 | 44065138156765 |
10 | 11320101012101 |
11 | 36749119a8102 |
12 | 1329ab2b12005 |
13 | 64163383695b |
14 | 2b1c78175697 |
15 | 1496dd8d88bb |
hex | a4baa998285 |
11320101012101 has 8 divisors (see below), whose sum is σ = 12938339292480. Its totient is φ = 9702132979968.
The previous prime is 11320101012043. The next prime is 11320101012163. The reversal of 11320101012101 is 10121010102311.
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-11320101012101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11320101012191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67472291 + ... + 67639856.
It is an arithmetic number, because the mean of its divisors is an integer number (1617292411560).
Almost surely, 211320101012101 is an apocalyptic number.
It is an amenable number.
11320101012101 is a deficient number, since it is larger than the sum of its proper divisors (1618238280379).
11320101012101 is a wasteful number, since it uses less digits than its factorization.
11320101012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135124123.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 11320101012101 its reverse (10121010102311), we get a palindrome (21441111114412).
The spelling of 11320101012101 in words is "eleven trillion, three hundred twenty billion, one hundred one million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •