Base | Representation |
---|---|
bin | 1010000001000010101100… |
… | …1010011110011011011111 |
3 | 1102222211112022200010101202 |
4 | 2200100223022132123133 |
5 | 2420414131200011221 |
6 | 35231151154030115 |
7 | 2214443624053412 |
oct | 240205312363337 |
9 | 42884468603352 |
10 | 11013020313311 |
11 | 3566660949025 |
12 | 129a49227833b |
13 | 61b6a5a88963 |
14 | 2a10668abb79 |
15 | 1417197bed0b |
hex | a042b29e6df |
11013020313311 has 8 divisors (see below), whose sum is σ = 11594575897200. Its totient is φ = 10431657023040.
The previous prime is 11013020313301. The next prime is 11013020313359. The reversal of 11013020313311 is 11331302031011.
11013020313311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-11013020313311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11013020313301) 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, 47955830 + ... + 48184931.
It is an arithmetic number, because the mean of its divisors is an integer number (1449321987150).
Almost surely, 211013020313311 is an apocalyptic number.
11013020313311 is a deficient number, since it is larger than the sum of its proper divisors (581555583889).
11013020313311 is an equidigital number, since it uses as much as digits as its factorization.
11013020313311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96146809.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 11013020313311 its reverse (11331302031011), we get a palindrome (22344322344322).
The spelling of 11013020313311 in words is "eleven trillion, thirteen billion, twenty million, three hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •