Base | Representation |
---|---|
bin | 1010010011100000101111… |
… | …1001011000110100100101 |
3 | 1111010011112201020222020012 |
4 | 2210320023321120310211 |
5 | 2441114000232220401 |
6 | 40033024554420005 |
7 | 2246405655112022 |
oct | 244701371306445 |
9 | 44104481228205 |
10 | 11330323320101 |
11 | 3679188151435 |
12 | 132ba86431605 |
13 | 6425a25bc206 |
14 | 2b2567a46549 |
15 | 149adb05a8bb |
hex | a4e0be58d25 |
11330323320101 has 2 divisors, whose sum is σ = 11330323320102. Its totient is φ = 11330323320100.
The previous prime is 11330323320079. The next prime is 11330323320167. The reversal of 11330323320101 is 10102332303311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11175816150625 + 154507169476 = 3343025^2 + 393074^2 .
It is an emirp because it is prime and its reverse (10102332303311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11330323320101 - 242 = 6932276808997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11330323320191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665161660050 + 5665161660051.
It is an arithmetic number, because the mean of its divisors is an integer number (5665161660051).
Almost surely, 211330323320101 is an apocalyptic number.
It is an amenable number.
11330323320101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11330323320101 is an equidigital number, since it uses as much as digits as its factorization.
11330323320101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 11330323320101 its reverse (10102332303311), we get a palindrome (21432655623412).
The spelling of 11330323320101 in words is "eleven trillion, three hundred thirty billion, three hundred twenty-three million, three hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •