Base | Representation |
---|---|
bin | 1010010011000101110111… |
… | …1100111101000100101101 |
3 | 1111002110221000012222210121 |
4 | 2210301131330331010231 |
5 | 2441004212133132031 |
6 | 40025433121204541 |
7 | 2246032136255206 |
oct | 244613574750455 |
9 | 44073830188717 |
10 | 11323110052141 |
11 | 3676116482458 |
12 | 132a5b2790751 |
13 | 6419c3064b14 |
14 | 2b2081a525ad |
15 | 149817b66011 |
hex | a4c5df3d12d |
11323110052141 has 4 divisors (see below), whose sum is σ = 11919063212800. Its totient is φ = 10727156891484.
The previous prime is 11323110052013. The next prime is 11323110052151. The reversal of 11323110052141 is 14125001132311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11323110052141 - 27 = 11323110052013 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 (11323110052151) 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, 297976580301 + ... + 297976580338.
It is an arithmetic number, because the mean of its divisors is an integer number (2979765803200).
Almost surely, 211323110052141 is an apocalyptic number.
It is an amenable number.
11323110052141 is a deficient number, since it is larger than the sum of its proper divisors (595953160659).
11323110052141 is an equidigital number, since it uses as much as digits as its factorization.
11323110052141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 595953160658.
The product of its (nonzero) digits is 720, while the sum is 25.
Adding to 11323110052141 its reverse (14125001132311), we get a palindrome (25448111184452).
The spelling of 11323110052141 in words is "eleven trillion, three hundred twenty-three billion, one hundred ten million, fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •