Base | Representation |
---|---|
bin | 1010010011100111011100… |
… | …1011000111100011111111 |
3 | 1111010100012010220210102012 |
4 | 2210321313023013203333 |
5 | 2441131142010130421 |
6 | 40033523330521435 |
7 | 2246501401205360 |
oct | 244716713074377 |
9 | 44110163823365 |
10 | 11332123130111 |
11 | 3679a21096323 |
12 | 13302a913627b |
13 | 6427cb443954 |
14 | 2b2698aadb67 |
15 | 149b9407795b |
hex | a4e772c78ff |
11332123130111 has 8 divisors (see below), whose sum is σ = 13514084726784. Its totient is φ = 9290933249400.
The previous prime is 11332123130093. The next prime is 11332123130137. The reversal of 11332123130111 is 11103132123311.
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 11332123130111 - 210 = 11332123129087 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11332123130611) 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, 35192928815 + ... + 35192929136.
It is an arithmetic number, because the mean of its divisors is an integer number (1689260590848).
Almost surely, 211332123130111 is an apocalyptic number.
11332123130111 is a deficient number, since it is larger than the sum of its proper divisors (2181961596673).
11332123130111 is an equidigital number, since it uses as much as digits as its factorization.
11332123130111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70385857981.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 11332123130111 its reverse (11103132123311), we get a palindrome (22435255253422).
The spelling of 11332123130111 in words is "eleven trillion, three hundred thirty-two billion, one hundred twenty-three million, one hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •