Base | Representation |
---|---|
bin | 10011010000010110110… |
… | …100010110001000100101 |
3 | 11200111111100212100010212 |
4 | 103100112310112020211 |
5 | 133134440040414234 |
6 | 2451515034025205 |
7 | 164412640530641 |
oct | 23202664261045 |
9 | 4614440770125 |
10 | 1323232748069 |
11 | 4701a8431731 |
12 | 19454bb78205 |
13 | 97a1b46864b |
14 | 4808ad41c21 |
15 | 246488ac5ce |
hex | 13416d16225 |
1323232748069 has 2 divisors, whose sum is σ = 1323232748070. Its totient is φ = 1323232748068.
The previous prime is 1323232748039. The next prime is 1323232748081. The reversal of 1323232748069 is 9608472323231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 999970000225 + 323262747844 = 999985^2 + 568562^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1323232748069 is a prime.
It is a super-2 number, since 2×13232327480692 (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 (1323232748009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661616374034 + 661616374035.
It is an arithmetic number, because the mean of its divisors is an integer number (661616374035).
Almost surely, 21323232748069 is an apocalyptic number.
It is an amenable number.
1323232748069 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323232748069 is an equidigital number, since it uses as much as digits as its factorization.
1323232748069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2612736, while the sum is 50.
The spelling of 1323232748069 in words is "one trillion, three hundred twenty-three billion, two hundred thirty-two million, seven hundred forty-eight thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •