Base | Representation |
---|---|
bin | 1010010010100101111111… |
… | …1100011010101010000011 |
3 | 1111001122211200121200102121 |
4 | 2210221133330122222003 |
5 | 2440334201200443021 |
6 | 40021500101225111 |
7 | 2245310120113363 |
oct | 244513774325203 |
9 | 44048750550377 |
10 | 11314553531011 |
11 | 3672525553495 |
12 | 1328a05102197 |
13 | 640c5b43a273 |
14 | 2b18ad4bc9a3 |
15 | 1494b688a741 |
hex | a4a5ff1aa83 |
11314553531011 has 8 divisors (see below), whose sum is σ = 11432524921664. Its totient is φ = 11196609212160.
The previous prime is 11314553531009. The next prime is 11314553531023. The reversal of 11314553531011 is 11013535541311.
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 11314553531011 - 21 = 11314553531009 is a prime.
It is a super-2 number, since 2×113145535310112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11314553931011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5927160 + ... + 7600021.
It is an arithmetic number, because the mean of its divisors is an integer number (1429065615208).
Almost surely, 211314553531011 is an apocalyptic number.
11314553531011 is a deficient number, since it is larger than the sum of its proper divisors (117971390653).
11314553531011 is an equidigital number, since it uses as much as digits as its factorization.
11314553531011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13535901.
The product of its (nonzero) digits is 13500, while the sum is 34.
The spelling of 11314553531011 in words is "eleven trillion, three hundred fourteen billion, five hundred fifty-three million, five hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •