Base | Representation |
---|---|
bin | 1010001100101100000101… |
… | …1101010000000101010111 |
3 | 1110200221222221022021200012 |
4 | 2203023001131100011113 |
5 | 2432203422220011203 |
6 | 35503122021110435 |
7 | 2235056220023153 |
oct | 243130135200527 |
9 | 43627887267605 |
10 | 11213110313303 |
11 | 36334a94a0588 |
12 | 1311213b5841b |
13 | 634512929a62 |
14 | 2aaa088da063 |
15 | 146a2aac0bd8 |
hex | a32c1750157 |
11213110313303 has 16 divisors (see below), whose sum is σ = 12078337130496. Its totient is φ = 10379373438720.
The previous prime is 11213110313233. The next prime is 11213110313333. The reversal of 11213110313303 is 30331301131211.
It is a cyclic number.
It is not a de Polignac number, because 11213110313303 - 216 = 11213110247767 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11213110313333) 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 15 ways as a sum of consecutive naturals, for example, 39399050 + ... + 39682632.
It is an arithmetic number, because the mean of its divisors is an integer number (754896070656).
Almost surely, 211213110313303 is an apocalyptic number.
11213110313303 is a deficient number, since it is larger than the sum of its proper divisors (865226817193).
11213110313303 is a wasteful number, since it uses less digits than its factorization.
11213110313303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339094.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 11213110313303 its reverse (30331301131211), we get a palindrome (41544411444514).
The spelling of 11213110313303 in words is "eleven trillion, two hundred thirteen billion, one hundred ten million, three hundred thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •