Base | Representation |
---|---|
bin | 10011011000100010000… |
… | …011111100111001110101 |
3 | 11201100011011022011001121 |
4 | 103120202003330321311 |
5 | 133310424344313442 |
6 | 2455530105223541 |
7 | 165143324301565 |
oct | 23304203747165 |
9 | 4640134264047 |
10 | 1332011322997 |
11 | 4739a2736a33 |
12 | 19619ba91bb1 |
13 | 987ba09c694 |
14 | 48680b98da5 |
15 | 249ae3eb967 |
hex | 136220fce75 |
1332011322997 has 2 divisors, whose sum is σ = 1332011322998. Its totient is φ = 1332011322996.
The previous prime is 1332011322979. The next prime is 1332011323007. The reversal of 1332011322997 is 7992231102331.
Together with previous prime (1332011322979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1307075439076 + 24935883921 = 1143274^2 + 157911^2 .
It is a cyclic number.
It is not a de Polignac number, because 1332011322997 - 27 = 1332011322869 is a prime.
It is a super-2 number, since 2×13320113229972 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1332011322937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 666005661498 + 666005661499.
It is an arithmetic number, because the mean of its divisors is an integer number (666005661499).
Almost surely, 21332011322997 is an apocalyptic number.
It is an amenable number.
1332011322997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1332011322997 is an equidigital number, since it uses as much as digits as its factorization.
1332011322997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122472, while the sum is 43.
The spelling of 1332011322997 in words is "one trillion, three hundred thirty-two billion, eleven million, three hundred twenty-two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •