Base | Representation |
---|---|
bin | 1010001100110000101011… |
… | …0000001001101010010101 |
3 | 1110201002011122012001212122 |
4 | 2203030022300021222111 |
5 | 2432213432020121001 |
6 | 35503444025425325 |
7 | 2235131541152534 |
oct | 243141260115225 |
9 | 43632148161778 |
10 | 11214340004501 |
11 | 3633a7a6367a7 |
12 | 13114b793b245 |
13 | 63467a61879a |
14 | 2aaac3d5831b |
15 | 146a9da23b1b |
hex | a330ac09a95 |
11214340004501 has 8 divisors (see below), whose sum is σ = 11584816456704. Its totient is φ = 10844408774160.
The previous prime is 11214340004477. The next prime is 11214340004503. The reversal of 11214340004501 is 10540004341211.
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 11214340004501 - 218 = 11214339742357 is a prime.
It is a super-2 number, since 2×112143400045012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11214340004503) 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, 136263650 + ... + 136345923.
It is an arithmetic number, because the mean of its divisors is an integer number (1448102057088).
Almost surely, 211214340004501 is an apocalyptic number.
It is an amenable number.
11214340004501 is a deficient number, since it is larger than the sum of its proper divisors (370476452203).
11214340004501 is a wasteful number, since it uses less digits than its factorization.
11214340004501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272610931.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 11214340004501 its reverse (10540004341211), we get a palindrome (21754344345712).
The spelling of 11214340004501 in words is "eleven trillion, two hundred fourteen billion, three hundred forty million, four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •