Base | Representation |
---|---|
bin | 10011011000100010001… |
… | …010110100011010011101 |
3 | 11201100011021200121111212 |
4 | 103120202022310122131 |
5 | 133310430324420404 |
6 | 2455530211554205 |
7 | 165143345510225 |
oct | 23304212643235 |
9 | 4640137617455 |
10 | 1332013123229 |
11 | 4739a3756528 |
12 | 1961a05bb965 |
13 | 987ba57cbc9 |
14 | 48681107085 |
15 | 249ae65506e |
hex | 136222b469d |
1332013123229 has 2 divisors, whose sum is σ = 1332013123230. Its totient is φ = 1332013123228.
The previous prime is 1332013123201. The next prime is 1332013123253. The reversal of 1332013123229 is 9223213102331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 774616495129 + 557396628100 = 880123^2 + 746590^2 .
It is a cyclic number.
It is not a de Polignac number, because 1332013123229 - 212 = 1332013119133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1332013123195 and 1332013123204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1332013122229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 666006561614 + 666006561615.
It is an arithmetic number, because the mean of its divisors is an integer number (666006561615).
Almost surely, 21332013123229 is an apocalyptic number.
It is an amenable number.
1332013123229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1332013123229 is an equidigital number, since it uses as much as digits as its factorization.
1332013123229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 1332013123229 in words is "one trillion, three hundred thirty-two billion, thirteen million, one hundred twenty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •