Base | Representation |
---|---|
bin | 1011001101110100110001… |
… | …0111000010000100011001 |
3 | 1121122221101111102200022011 |
4 | 2303131030113002010121 |
5 | 3104022201321304032 |
6 | 42121145304025521 |
7 | 2411652506154241 |
oct | 263351427020431 |
9 | 47587344380264 |
10 | 12332132213017 |
11 | 3a25034155351 |
12 | 14720721622a1 |
13 | 6b5bb856c796 |
14 | 308c423dcb21 |
15 | 165bc14d5247 |
hex | b374c5c2119 |
12332132213017 has 2 divisors, whose sum is σ = 12332132213018. Its totient is φ = 12332132213016.
The previous prime is 12332132212993. The next prime is 12332132213101. The reversal of 12332132213017 is 71031223123321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11266656149056 + 1065476063961 = 3356584^2 + 1032219^2 .
It is a cyclic number.
It is not a de Polignac number, because 12332132213017 - 27 = 12332132212889 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12332132213017.
It is not a weakly prime, because it can be changed into another prime (12332132213617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6166066106508 + 6166066106509.
It is an arithmetic number, because the mean of its divisors is an integer number (6166066106509).
Almost surely, 212332132213017 is an apocalyptic number.
It is an amenable number.
12332132213017 is a deficient number, since it is larger than the sum of its proper divisors (1).
12332132213017 is an equidigital number, since it uses as much as digits as its factorization.
12332132213017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9072, while the sum is 31.
Adding to 12332132213017 its reverse (71031223123321), we get a palindrome (83363355336338).
The spelling of 12332132213017 in words is "twelve trillion, three hundred thirty-two billion, one hundred thirty-two million, two hundred thirteen thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •