Base | Representation |
---|---|
bin | 1010010011100000110001… |
… | …1010111011000100010011 |
3 | 1111010011120022210121020121 |
4 | 2210320030122323010103 |
5 | 2441114010010023443 |
6 | 40033025511051111 |
7 | 2246406122614564 |
oct | 244701432730423 |
9 | 44104508717217 |
10 | 11330332111123 |
11 | 3679192106243 |
12 | 132ba89370a97 |
13 | 6425a43796bc |
14 | 2b2568c9416b |
15 | 149adbbe54ed |
hex | a4e0c6bb113 |
11330332111123 has 4 divisors (see below), whose sum is σ = 11332089030600. Its totient is φ = 11328575191648.
The previous prime is 11330332111073. The next prime is 11330332111129. The reversal of 11330332111123 is 32111123303311.
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 11330332111123 - 29 = 11330332110611 is a prime.
It is a super-2 number, since 2×113303321111232 (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 (11330332111129) 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, 878450065 + ... + 878462962.
It is an arithmetic number, because the mean of its divisors is an integer number (2833022257650).
Almost surely, 211330332111123 is an apocalyptic number.
11330332111123 is a deficient number, since it is larger than the sum of its proper divisors (1756919477).
11330332111123 is an equidigital number, since it uses as much as digits as its factorization.
11330332111123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1756919476.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 11330332111123 its reverse (32111123303311), we get a palindrome (43441455414434).
The spelling of 11330332111123 in words is "eleven trillion, three hundred thirty billion, three hundred thirty-two million, one hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •