Base | Representation |
---|---|
bin | 1010011000011010100010… |
… | …0001000001000111101101 |
3 | 1111102012221222122120200101 |
4 | 2212012220201001013231 |
5 | 2444004002131124401 |
6 | 40135435131031101 |
7 | 2255450215315654 |
oct | 246065041010755 |
9 | 44365858576611 |
10 | 11414555333101 |
11 | 37009819aa518 |
12 | 134427359b491 |
13 | 64a50742b01b |
14 | 2b667888c19b |
15 | 14bdbad2e101 |
hex | a61a88411ed |
11414555333101 has 4 divisors (see below), whose sum is σ = 11542808763900. Its totient is φ = 11286301902304.
The previous prime is 11414555333047. The next prime is 11414555333131. The reversal of 11414555333101 is 10133355541411.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 661888009225 + 10752667323876 = 813565^2 + 3279126^2 .
It is a cyclic number.
It is not a de Polignac number, because 11414555333101 - 227 = 11414421115373 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 (11414555333131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64126715266 + ... + 64126715443.
It is an arithmetic number, because the mean of its divisors is an integer number (2885702190975).
Almost surely, 211414555333101 is an apocalyptic number.
It is an amenable number.
11414555333101 is a deficient number, since it is larger than the sum of its proper divisors (128253430799).
11414555333101 is an equidigital number, since it uses as much as digits as its factorization.
11414555333101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128253430798.
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 11414555333101 in words is "eleven trillion, four hundred fourteen billion, five hundred fifty-five million, three hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •