Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011101000011111111011 |
3 | 1111010020122000122012220122 |
4 | 2210320330003220133323 |
5 | 2441122124103441443 |
6 | 40033241100443455 |
7 | 2246434665662630 |
oct | 244707403503773 |
9 | 44106560565818 |
10 | 11331131312123 |
11 | 3679562250837 |
12 | 1330070b4958b |
13 | 6426a0b0c9bc |
14 | 2b2603092187 |
15 | 149b36e60968 |
hex | a4e3c0e87fb |
11331131312123 has 8 divisors (see below), whose sum is σ = 13631436165120. Its totient is φ = 9201219411240.
The previous prime is 11331131312071. The next prime is 11331131312143. The reversal of 11331131312123 is 32121313113311.
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 11331131312123 - 220 = 11331130263547 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11331131312092 and 11331131312101.
It is not an unprimeable number, because it can be changed into a prime (11331131312143) 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, 42598237883 + ... + 42598238148.
It is an arithmetic number, because the mean of its divisors is an integer number (1703929520640).
Almost surely, 211331131312123 is an apocalyptic number.
11331131312123 is a deficient number, since it is larger than the sum of its proper divisors (2300304852997).
11331131312123 is an equidigital number, since it uses as much as digits as its factorization.
11331131312123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85196476057.
The product of its digits is 972, while the sum is 26.
Adding to 11331131312123 its reverse (32121313113311), we get a palindrome (43452444425434).
The spelling of 11331131312123 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, three hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •