Base | Representation |
---|---|
bin | 1101101001110000110000… |
… | …11011000000001110000011 |
3 | 10221022002121220111020002202 |
4 | 12310320120123000032003 |
5 | 12413341012132143021 |
6 | 143504004513303415 |
7 | 6216014606031230 |
oct | 664703033001603 |
9 | 127262556436082 |
10 | 30022231131011 |
11 | 96253a18828a9 |
12 | 344a614564b6b |
13 | 139a113128242 |
14 | 75b125ad4787 |
15 | 370e31860a0b |
hex | 1b4e186c0383 |
30022231131011 has 8 divisors (see below), whose sum is σ = 34311492232704. Its totient is φ = 25733062764360.
The previous prime is 30022231130989. The next prime is 30022231131073. The reversal of 30022231131011 is 11013113222003.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-30022231131011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30022231131911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22488635 + ... + 23786196.
It is an arithmetic number, because the mean of its divisors is an integer number (4288936529088).
Almost surely, 230022231131011 is an apocalyptic number.
30022231131011 is a deficient number, since it is larger than the sum of its proper divisors (4289261101693).
30022231131011 is an equidigital number, since it uses as much as digits as its factorization.
30022231131011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46367521.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 30022231131011 its reverse (11013113222003), we get a palindrome (41035344353014).
The spelling of 30022231131011 in words is "thirty trillion, twenty-two billion, two hundred thirty-one million, one hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •