Base | Representation |
---|---|
bin | 11100001110101100… |
… | …100011001000011101 |
3 | 2220020110010010022012 |
4 | 130032230203020131 |
5 | 444034200032313 |
6 | 21531433001005 |
7 | 2122100025314 |
oct | 341654431035 |
9 | 86213103265 |
10 | 30311330333 |
11 | 11944a57129 |
12 | 5a5b253165 |
13 | 2b20a2c12b |
14 | 167792b27b |
15 | bc6124da8 |
hex | 70eb2321d |
30311330333 has 8 divisors (see below), whose sum is σ = 30684116736. Its totient is φ = 29938724800.
The previous prime is 30311330311. The next prime is 30311330353. The reversal of 30311330333 is 33303311303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30311330333 - 222 = 30307136029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30311330299 and 30311330308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30311330353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 308948 + ... + 395058.
It is an arithmetic number, because the mean of its divisors is an integer number (3835514592).
Almost surely, 230311330333 is an apocalyptic number.
It is an amenable number.
30311330333 is a deficient number, since it is larger than the sum of its proper divisors (372786403).
30311330333 is an equidigital number, since it uses as much as digits as its factorization.
30311330333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90435.
The product of its (nonzero) digits is 2187, while the sum is 23.
Adding to 30311330333 its reverse (33303311303), we get a palindrome (63614641636).
The spelling of 30311330333 in words is "thirty billion, three hundred eleven million, three hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •