Base | Representation |
---|---|
bin | 1101101111110111110111… |
… | …01011100111001001111001 |
3 | 10222001011121011100222001010 |
4 | 12313323323223213021321 |
5 | 12430311022244434113 |
6 | 144144252041144133 |
7 | 6240130104630225 |
oct | 667737353471171 |
9 | 128034534328033 |
10 | 30232202343033 |
11 | 96a6450086199 |
12 | 348325348b049 |
13 | 13b3b66195472 |
14 | 7673641a3785 |
15 | 3766203a81c3 |
hex | 1b7efbae7279 |
30232202343033 has 8 divisors (see below), whose sum is σ = 40309958344768. Its totient is φ = 20154623951664.
The previous prime is 30232202343023. The next prime is 30232202343061. The reversal of 30232202343033 is 33034320223203.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30232202343033 - 28 = 30232202342777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30232202343023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44004910 + ... + 44686647.
It is an arithmetic number, because the mean of its divisors is an integer number (5038744793096).
Almost surely, 230232202343033 is an apocalyptic number.
It is an amenable number.
30232202343033 is a deficient number, since it is larger than the sum of its proper divisors (10077756001735).
30232202343033 is a wasteful number, since it uses less digits than its factorization.
30232202343033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88805183.
The product of its (nonzero) digits is 46656, while the sum is 30.
Adding to 30232202343033 its reverse (33034320223203), we get a palindrome (63266522566236).
The spelling of 30232202343033 in words is "thirty trillion, two hundred thirty-two billion, two hundred two million, three hundred forty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •