Base | Representation |
---|---|
bin | 1101101111111001010110… |
… | …01110100011101101010111 |
3 | 10222001020122202100211010002 |
4 | 12313330223032203231113 |
5 | 12430314141002024421 |
6 | 144144503134321515 |
7 | 6240155632113251 |
oct | 667745316435527 |
9 | 128036582324102 |
10 | 30233000033111 |
11 | 96a681a389597 |
12 | 348343665929b |
13 | 13b3c62519b25 |
14 | 7673dc0cacd1 |
15 | 37666a425b0b |
hex | 1b7f2b3a3b57 |
30233000033111 has 8 divisors (see below), whose sum is σ = 31050426518160. Its totient is φ = 29415590304768.
The previous prime is 30233000033099. The next prime is 30233000033141. The reversal of 30233000033111 is 11133000033203.
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 30233000033111 - 234 = 30215820163927 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30233000033141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 488321 + ... + 7791306.
It is an arithmetic number, because the mean of its divisors is an integer number (3881303314770).
Almost surely, 230233000033111 is an apocalyptic number.
30233000033111 is a deficient number, since it is larger than the sum of its proper divisors (817426485049).
30233000033111 is an equidigital number, since it uses as much as digits as its factorization.
30233000033111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8378353.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 30233000033111 its reverse (11133000033203), we get a palindrome (41366000066314).
The spelling of 30233000033111 in words is "thirty trillion, two hundred thirty-three billion, thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •