Base | Representation |
---|---|
bin | 1010001001000110010000… |
… | …0001111100110101101001 |
3 | 1110111001202011112222001201 |
4 | 2202101210001330311221 |
5 | 2430201043303131403 |
6 | 35414515532444201 |
7 | 2230443263242066 |
oct | 242214401746551 |
9 | 43431664488051 |
10 | 11151413333353 |
11 | 360a319123357 |
12 | 1301275919661 |
13 | 62b75c73cb27 |
14 | 2a7a34909c6d |
15 | 1451193b421d |
hex | a246407cd69 |
11151413333353 has 8 divisors (see below), whose sum is σ = 11155801723776. Its totient is φ = 11147025783600.
The previous prime is 11151413333341. The next prime is 11151413333369. The reversal of 11151413333353 is 35333331415111.
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-11151413333353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11151413333953) 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, 27014238 + ... + 27423928.
It is an arithmetic number, because the mean of its divisors is an integer number (1394475215472).
Almost surely, 211151413333353 is an apocalyptic number.
It is an amenable number.
11151413333353 is a deficient number, since it is larger than the sum of its proper divisors (4388390423).
11151413333353 is an equidigital number, since it uses as much as digits as its factorization.
11151413333353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420335.
The product of its digits is 72900, while the sum is 37.
Adding to 11151413333353 its reverse (35333331415111), we get a palindrome (46484744748464).
The spelling of 11151413333353 in words is "eleven trillion, one hundred fifty-one billion, four hundred thirteen million, three hundred thirty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •