Base | Representation |
---|---|
bin | 11100001010000011… |
… | …000000110101111001 |
3 | 2220001000100110020021 |
4 | 130022003000311321 |
5 | 443404213124423 |
6 | 21520005130441 |
7 | 2120132043214 |
oct | 341203006571 |
9 | 86030313207 |
10 | 30233333113 |
11 | 11904a23715 |
12 | 5a390b9a21 |
13 | 2b0a820529 |
14 | 166b42677b |
15 | bbe36995d |
hex | 70a0c0d79 |
30233333113 has 4 divisors (see below), whose sum is σ = 30233708928. Its totient is φ = 30232957300.
The previous prime is 30233333111. The next prime is 30233333149. The reversal of 30233333113 is 31133333203.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 30233333113 - 21 = 30233333111 is a prime.
It is a super-2 number, since 2×302333331132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30233333111) 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, 12913 + ... + 246238.
It is an arithmetic number, because the mean of its divisors is an integer number (7558427232).
Almost surely, 230233333113 is an apocalyptic number.
It is an amenable number.
30233333113 is a deficient number, since it is larger than the sum of its proper divisors (375815).
30233333113 is a wasteful number, since it uses less digits than its factorization.
30233333113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375814.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 30233333113 its reverse (31133333203), we get a palindrome (61366666316).
The spelling of 30233333113 in words is "thirty billion, two hundred thirty-three million, three hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •