Base | Representation |
---|---|
bin | 1101101111010000011000… |
… | …00111110010111100001001 |
3 | 10221222010212202200112112212 |
4 | 12313220030013302330021 |
5 | 12424434113323032223 |
6 | 144130424320514505 |
7 | 6235446553166351 |
oct | 667501407627411 |
9 | 127863782615485 |
10 | 30211003330313 |
11 | 9698461865173 |
12 | 347b117a7ba35 |
13 | 13b1b68280860 |
14 | 766312967b61 |
15 | 375cce249278 |
hex | 1b7a0c1f2f09 |
30211003330313 has 8 divisors (see below), whose sum is σ = 32698418760000. Its totient is φ = 27746943914448.
The previous prime is 30211003330307. The next prime is 30211003330331. The reversal of 30211003330313 is 31303330011203.
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 30211003330313 - 232 = 30206708363017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30211003330393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5839000763 + ... + 5839005936.
It is an arithmetic number, because the mean of its divisors is an integer number (4087302345000).
Almost surely, 230211003330313 is an apocalyptic number.
It is an amenable number.
30211003330313 is a deficient number, since it is larger than the sum of its proper divisors (2487415429687).
30211003330313 is a wasteful number, since it uses less digits than its factorization.
30211003330313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11678006911.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 30211003330313 its reverse (31303330011203), we get a palindrome (61514333341516).
The spelling of 30211003330313 in words is "thirty trillion, two hundred eleven billion, three million, three hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •