Base | Representation |
---|---|
bin | 1100000111111011010100… |
… | …1011001000000011000101 |
3 | 1202012100220010201020220202 |
4 | 3001332311023020003011 |
5 | 3221401000204042013 |
6 | 44203511011140245 |
7 | 2544040555622546 |
oct | 301766513100305 |
9 | 52170803636822 |
10 | 13330323112133 |
11 | 427a3a396aa45 |
12 | 15b360a2a4685 |
13 | 759075aaca11 |
14 | 3412964804cd |
15 | 181b43ee6858 |
hex | c1fb52c80c5 |
13330323112133 has 2 divisors, whose sum is σ = 13330323112134. Its totient is φ = 13330323112132.
The previous prime is 13330323112069. The next prime is 13330323112151. The reversal of 13330323112133 is 33121132303331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8384227175809 + 4946095936324 = 2895553^2 + 2223982^2 .
It is a cyclic number.
It is not a de Polignac number, because 13330323112133 - 26 = 13330323112069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13330323112096 and 13330323112105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13330323115133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6665161556066 + 6665161556067.
It is an arithmetic number, because the mean of its divisors is an integer number (6665161556067).
Almost surely, 213330323112133 is an apocalyptic number.
It is an amenable number.
13330323112133 is a deficient number, since it is larger than the sum of its proper divisors (1).
13330323112133 is an equidigital number, since it uses as much as digits as its factorization.
13330323112133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 29.
Adding to 13330323112133 its reverse (33121132303331), we get a palindrome (46451455415464).
The spelling of 13330323112133 in words is "thirteen trillion, three hundred thirty billion, three hundred twenty-three million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •