Base | Representation |
---|---|
bin | 11000011101100111… |
… | …00100101000111101 |
3 | 1020220021121212212221 |
4 | 30032303210220331 |
5 | 203344111133313 |
6 | 10011112125341 |
7 | 643312141114 |
oct | 141663445075 |
9 | 36807555787 |
10 | 13133302333 |
11 | 562a452478 |
12 | 2666396851 |
13 | 1313ba5618 |
14 | 8c8348c7b |
15 | 51ced3c8d |
hex | 30ece4a3d |
13133302333 has 4 divisors (see below), whose sum is σ = 13139652060. Its totient is φ = 13126952608.
The previous prime is 13133302309. The next prime is 13133302337. The reversal of 13133302333 is 33320333131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5122694329 + 8010608004 = 71573^2 + 89502^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13133302333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13133302298 and 13133302307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13133302337) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3171760 + ... + 3175897.
It is an arithmetic number, because the mean of its divisors is an integer number (3284913015).
Almost surely, 213133302333 is an apocalyptic number.
It is an amenable number.
13133302333 is a deficient number, since it is larger than the sum of its proper divisors (6349727).
13133302333 is an equidigital number, since it uses as much as digits as its factorization.
13133302333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6349726.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 13133302333 its reverse (33320333131), we get a palindrome (46453635464).
The spelling of 13133302333 in words is "thirteen billion, one hundred thirty-three million, three hundred two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •