Base | Representation |
---|---|
bin | 10100110000001010… |
… | …01000000110000101 |
3 | 1001202110112112120011 |
4 | 22120011020012011 |
5 | 140304200242201 |
6 | 5041315110221 |
7 | 543044316232 |
oct | 123005100605 |
9 | 31673475504 |
10 | 11141415301 |
11 | 47a8047245 |
12 | 21ab2a2371 |
13 | 108730bc43 |
14 | 7799a2789 |
15 | 4531c5151 |
hex | 298148185 |
11141415301 has 8 divisors (see below), whose sum is σ = 11729671200. Its totient is φ = 10553346000.
The previous prime is 11141415287. The next prime is 11141415319. The reversal of 11141415301 is 10351414111.
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 11141415301 - 211 = 11141413253 is a prime.
It is a super-2 number, since 2×111414153012 (a number of 21 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 (11141415371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 85551 + ... + 172051.
It is an arithmetic number, because the mean of its divisors is an integer number (1466208900).
Almost surely, 211141415301 is an apocalyptic number.
It is an amenable number.
11141415301 is a deficient number, since it is larger than the sum of its proper divisors (588255899).
11141415301 is an equidigital number, since it uses as much as digits as its factorization.
11141415301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93299.
The product of its (nonzero) digits is 240, while the sum is 22.
Adding to 11141415301 its reverse (10351414111), we get a palindrome (21492829412).
The spelling of 11141415301 in words is "eleven billion, one hundred forty-one million, four hundred fifteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •