Base | Representation |
---|---|
bin | 1010010010100001000000… |
… | …1100000010110000011111 |
3 | 1111001112101102210010112221 |
4 | 2210220100030002300133 |
5 | 2440323431123401033 |
6 | 40021115221410211 |
7 | 2245232011450105 |
oct | 244502014026037 |
9 | 44045342703487 |
10 | 11313215450143 |
11 | 36719a9206532 |
12 | 13286b0b69967 |
13 | 640aa715b139 |
14 | 2b17c38c7c75 |
15 | 14943917712d |
hex | a4a10302c1f |
11313215450143 has 8 divisors (see below), whose sum is σ = 11514494657120. Its totient is φ = 11112446458080.
The previous prime is 11313215450129. The next prime is 11313215450161. The reversal of 11313215450143 is 34105451231311.
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 11313215450143 - 237 = 11175776496671 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11313215450099 and 11313215450108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11313215450113) 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, 127508988 + ... + 127597681.
It is an arithmetic number, because the mean of its divisors is an integer number (1439311832140).
Almost surely, 211313215450143 is an apocalyptic number.
11313215450143 is a deficient number, since it is larger than the sum of its proper divisors (201279206977).
11313215450143 is an equidigital number, since it uses as much as digits as its factorization.
11313215450143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 255107457.
The product of its (nonzero) digits is 21600, while the sum is 34.
Adding to 11313215450143 its reverse (34105451231311), we get a palindrome (45418666681454).
The spelling of 11313215450143 in words is "eleven trillion, three hundred thirteen billion, two hundred fifteen million, four hundred fifty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.526 sec. • engine limits •