Base | Representation |
---|---|
bin | 1010000010001010001010… |
… | …0011110011010011101111 |
3 | 1110001200001012212100020102 |
4 | 2200202202203303103233 |
5 | 2421222423021412234 |
6 | 35244042500141315 |
7 | 2216023165616402 |
oct | 240424243632357 |
9 | 43050035770212 |
10 | 11032203310319 |
11 | 3573805183664 |
12 | 12a214669783b |
13 | 620442109469 |
14 | 2a1d6647dd39 |
15 | 141e8d955c7e |
hex | a08a28f34ef |
11032203310319 has 8 divisors (see below), whose sum is σ = 11090475087840. Its totient is φ = 10973942977536.
The previous prime is 11032203310313. The next prime is 11032203310333. The reversal of 11032203310319 is 91301330223011.
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-11032203310319 is a prime.
It is a super-2 number, since 2×110322033103192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11032203310291 and 11032203310300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11032203310313) 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, 924734 + ... + 4787435.
It is an arithmetic number, because the mean of its divisors is an integer number (1386309385980).
Almost surely, 211032203310319 is an apocalyptic number.
11032203310319 is a deficient number, since it is larger than the sum of its proper divisors (58271777521).
11032203310319 is a wasteful number, since it uses less digits than its factorization.
11032203310319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5722369.
The product of its (nonzero) digits is 2916, while the sum is 29.
The spelling of 11032203310319 in words is "eleven trillion, thirty-two billion, two hundred three million, three hundred ten thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •