Base | Representation |
---|---|
bin | 10011010000001001000… |
… | …100001001110110000101 |
3 | 11200110220021200200101222 |
4 | 103100021010021312011 |
5 | 133134002003323023 |
6 | 2451440112330125 |
7 | 164404136355104 |
oct | 23201104116605 |
9 | 4613807620358 |
10 | 1323002011013 |
11 | 47009a165551 |
12 | 1944a6843945 |
13 | 979b270ba47 |
14 | 4806843c03b |
15 | 246334d0cc8 |
hex | 13409109d85 |
1323002011013 has 2 divisors, whose sum is σ = 1323002011014. Its totient is φ = 1323002011012.
The previous prime is 1323002010997. The next prime is 1323002011043. The reversal of 1323002011013 is 3101102003231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1300826929444 + 22175081569 = 1140538^2 + 148913^2 .
It is a cyclic number.
It is not a de Polignac number, because 1323002011013 - 24 = 1323002010997 is a prime.
It is a super-2 number, since 2×13230020110132 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1323002010982 and 1323002011000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1323002011043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661501005506 + 661501005507.
It is an arithmetic number, because the mean of its divisors is an integer number (661501005507).
Almost surely, 21323002011013 is an apocalyptic number.
It is an amenable number.
1323002011013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323002011013 is an equidigital number, since it uses as much as digits as its factorization.
1323002011013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1323002011013 its reverse (3101102003231), we get a palindrome (4424104014244).
The spelling of 1323002011013 in words is "one trillion, three hundred twenty-three billion, two million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •