Base | Representation |
---|---|
bin | 1100000111111010001100… |
… | …0111100111011101011101 |
3 | 1202012100010000201211210021 |
4 | 3001332203013213131131 |
5 | 3221344340132433313 |
6 | 44203420550512141 |
7 | 2544030220133602 |
oct | 301764307473535 |
9 | 52170100654707 |
10 | 13330020202333 |
11 | 427a25898936a |
12 | 15b3544965651 |
13 | 759028103653 |
14 | 3412681506a9 |
15 | 181b2761078d |
hex | c1fa31e775d |
13330020202333 has 2 divisors, whose sum is σ = 13330020202334. Its totient is φ = 13330020202332.
The previous prime is 13330020202321. The next prime is 13330020202337. The reversal of 13330020202333 is 33320202003331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13328610800569 + 1409401764 = 3650837^2 + 37542^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13330020202333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13330020202298 and 13330020202307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13330020202337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6665010101166 + 6665010101167.
It is an arithmetic number, because the mean of its divisors is an integer number (6665010101167).
Almost surely, 213330020202333 is an apocalyptic number.
It is an amenable number.
13330020202333 is a deficient number, since it is larger than the sum of its proper divisors (1).
13330020202333 is an equidigital number, since it uses as much as digits as its factorization.
13330020202333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 25.
Adding to 13330020202333 its reverse (33320202003331), we get a palindrome (46650222205664).
The spelling of 13330020202333 in words is "thirteen trillion, three hundred thirty billion, twenty million, two hundred two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •