Base | Representation |
---|---|
bin | 1101101001001011101100… |
… | …01111011001010111101001 |
3 | 10221020012020222120210000101 |
4 | 12310211312033121113221 |
5 | 12413024233024410441 |
6 | 143450514045505401 |
7 | 6214411466610241 |
oct | 664456617312751 |
9 | 127205228523011 |
10 | 30002330310121 |
11 | 9617a0a334594 |
12 | 344679b872261 |
13 | 1398291167590 |
14 | 75a198a68b21 |
15 | 370669686231 |
hex | 1b49763d95e9 |
30002330310121 has 8 divisors (see below), whose sum is σ = 32322041486280. Its totient is φ = 27684310507392.
The previous prime is 30002330310083. The next prime is 30002330310133. The reversal of 30002330310121 is 12101303320003.
It can be written as a sum of positive squares in 4 ways, for example, as 1615428290025 + 28386902020096 = 1270995^2 + 5327936^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30002330310121 is a prime.
It is not an unprimeable number, because it can be changed into a prime (30002330310151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 422806510 + ... + 422877463.
It is an arithmetic number, because the mean of its divisors is an integer number (4040255185785).
Almost surely, 230002330310121 is an apocalyptic number.
It is an amenable number.
30002330310121 is a deficient number, since it is larger than the sum of its proper divisors (2319711176159).
30002330310121 is a wasteful number, since it uses less digits than its factorization.
30002330310121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 845686715.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 30002330310121 its reverse (12101303320003), we get a palindrome (42103633630124).
The spelling of 30002330310121 in words is "thirty trillion, two billion, three hundred thirty million, three hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •