Base | Representation |
---|---|
bin | 11100000100000101… |
… | …000010110110011101 |
3 | 2212210000221021121212 |
4 | 130010011002312131 |
5 | 443203044433313 |
6 | 21502031034205 |
7 | 2114504664563 |
oct | 340405026635 |
9 | 85700837555 |
10 | 30133202333 |
11 | 11863452a03 |
12 | 5a0b66b965 |
13 | 2ac2b62350 |
14 | 165bddda33 |
15 | bb568b3a8 |
hex | 704142d9d |
30133202333 has 4 divisors (see below), whose sum is σ = 32451140988. Its totient is φ = 27815263680.
The previous prime is 30133202329. The next prime is 30133202369. The reversal of 30133202333 is 33320233103.
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 6551607364 + 23581594969 = 80942^2 + 153563^2 .
It is a cyclic number.
It is not a de Polignac number, because 30133202333 - 22 = 30133202329 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30133202299 and 30133202308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30133202383) 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, 1158969308 + ... + 1158969333.
It is an arithmetic number, because the mean of its divisors is an integer number (8112785247).
Almost surely, 230133202333 is an apocalyptic number.
It is an amenable number.
30133202333 is a deficient number, since it is larger than the sum of its proper divisors (2317938655).
30133202333 is a wasteful number, since it uses less digits than its factorization.
30133202333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2317938654.
The product of its (nonzero) digits is 2916, while the sum is 23.
Adding to 30133202333 its reverse (33320233103), we get a palindrome (63453435436).
The spelling of 30133202333 in words is "thirty billion, one hundred thirty-three million, two hundred two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •