Base | Representation |
---|---|
bin | 1010001000100000011001… |
… | …1101010110101101011011 |
3 | 1110110002112010002012011002 |
4 | 2202020012131112231123 |
5 | 2430014241400234230 |
6 | 35410115440455215 |
7 | 2226633435264425 |
oct | 242100635265533 |
9 | 43402463065132 |
10 | 11141253524315 |
11 | 3605a85187462 |
12 | 12bb2bb31a50b |
13 | 62a8008caac5 |
14 | 2a734d467815 |
15 | 144c2248a545 |
hex | a2206756b5b |
11141253524315 has 4 divisors (see below), whose sum is σ = 13369504229184. Its totient is φ = 8913002819448.
The previous prime is 11141253524311. The next prime is 11141253524321. The reversal of 11141253524315 is 51342535214111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11141253524315 - 22 = 11141253524311 is a prime.
It is a super-2 number, since 2×111412535243152 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11141253524311) 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, 1114125352427 + ... + 1114125352436.
It is an arithmetic number, because the mean of its divisors is an integer number (3342376057296).
Almost surely, 211141253524315 is an apocalyptic number.
11141253524315 is a deficient number, since it is larger than the sum of its proper divisors (2228250704869).
11141253524315 is an equidigital number, since it uses as much as digits as its factorization.
11141253524315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2228250704868.
The product of its digits is 72000, while the sum is 38.
Adding to 11141253524315 its reverse (51342535214111), we get a palindrome (62483788738426).
The spelling of 11141253524315 in words is "eleven trillion, one hundred forty-one billion, two hundred fifty-three million, five hundred twenty-four thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •