Base | Representation |
---|---|
bin | 1010010010100001000010… |
… | …0101100100100110000101 |
3 | 1111001112101220101010112010 |
4 | 2210220100211210212011 |
5 | 2440323434332023331 |
6 | 40021120021044433 |
7 | 2245232122361640 |
oct | 244502045444605 |
9 | 44045356333463 |
10 | 11313222142341 |
11 | 3671a01a67479 |
12 | 13286b3256719 |
13 | 640aa8662212 |
14 | 2b17c474aa57 |
15 | 149439a49e46 |
hex | a4a10964985 |
11313222142341 has 8 divisors (see below), whose sum is σ = 17239195645504. Its totient is φ = 6464698367040.
The previous prime is 11313222142303. The next prime is 11313222142349. The reversal of 11313222142341 is 14324122231311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11313222142341 - 29 = 11313222141829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11313222142299 and 11313222142308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11313222142349) 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, 269362431940 + ... + 269362431981.
It is an arithmetic number, because the mean of its divisors is an integer number (2154899455688).
Almost surely, 211313222142341 is an apocalyptic number.
It is an amenable number.
11313222142341 is a deficient number, since it is larger than the sum of its proper divisors (5925973503163).
11313222142341 is an equidigital number, since it uses as much as digits as its factorization.
11313222142341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 538724863931.
The product of its digits is 6912, while the sum is 30.
Adding to 11313222142341 its reverse (14324122231311), we get a palindrome (25637344373652).
The spelling of 11313222142341 in words is "eleven trillion, three hundred thirteen billion, two hundred twenty-two million, one hundred forty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •