Base | Representation |
---|---|
bin | 1100000111111011010100… |
… | …1011001000000010000101 |
3 | 1202012100220010201020211101 |
4 | 3001332311023020002011 |
5 | 3221401000204041234 |
6 | 44203511011140101 |
7 | 2544040555622425 |
oct | 301766513100205 |
9 | 52170803636741 |
10 | 13330323112069 |
11 | 427a3a396a997 |
12 | 15b360a2a4631 |
13 | 759075aac992 |
14 | 341296480485 |
15 | 181b43ee6814 |
hex | c1fb52c8085 |
13330323112069 has 2 divisors, whose sum is σ = 13330323112070. Its totient is φ = 13330323112068.
The previous prime is 13330323111991. The next prime is 13330323112133. The reversal of 13330323112069 is 96021132303331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11697391821025 + 1632931291044 = 3420145^2 + 1277862^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13330323112069 is a prime.
It is a super-2 number, since 2×133303231120692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13330323212069) 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, 6665161556034 + 6665161556035.
It is an arithmetic number, because the mean of its divisors is an integer number (6665161556035).
Almost surely, 213330323112069 is an apocalyptic number.
It is an amenable number.
13330323112069 is a deficient number, since it is larger than the sum of its proper divisors (1).
13330323112069 is an equidigital number, since it uses as much as digits as its factorization.
13330323112069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52488, while the sum is 37.
The spelling of 13330323112069 in words is "thirteen trillion, three hundred thirty billion, three hundred twenty-three million, one hundred twelve thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •