Base | Representation |
---|---|
bin | 1011001101110101000001… |
… | …1111011010101110010001 |
3 | 1121122221120022211211122002 |
4 | 2303131100133122232101 |
5 | 3104022322042120032 |
6 | 42121200221323345 |
7 | 2411654310233411 |
oct | 263352037325621 |
9 | 47587508754562 |
10 | 12332201520017 |
11 | 3a2506a292765 |
12 | 1472091406555 |
13 | 6b5bc9a27a42 |
14 | 308c4b6c0641 |
15 | 165bc7625862 |
hex | b37507dab91 |
12332201520017 has 2 divisors, whose sum is σ = 12332201520018. Its totient is φ = 12332201520016.
The previous prime is 12332201519999. The next prime is 12332201520071. The reversal of 12332201520017 is 71002510223321.
Together with next prime (12332201520071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11193949381696 + 1138252138321 = 3345736^2 + 1066889^2 .
It is a cyclic number.
It is not a de Polignac number, because 12332201520017 - 222 = 12332197325713 is a prime.
It is not a weakly prime, because it can be changed into another prime (12332201520517) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6166100760008 + 6166100760009.
It is an arithmetic number, because the mean of its divisors is an integer number (6166100760009).
Almost surely, 212332201520017 is an apocalyptic number.
It is an amenable number.
12332201520017 is a deficient number, since it is larger than the sum of its proper divisors (1).
12332201520017 is an equidigital number, since it uses as much as digits as its factorization.
12332201520017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 12332201520017 its reverse (71002510223321), we get a palindrome (83334711743338).
The spelling of 12332201520017 in words is "twelve trillion, three hundred thirty-two billion, two hundred one million, five hundred twenty thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •