Base | Representation |
---|---|
bin | 1101101100011000000001… |
… | …10111010110011111110001 |
3 | 10221121200102011022201022111 |
4 | 12312030000313112133301 |
5 | 12421323414214103241 |
6 | 144013135315405321 |
7 | 6225344115514165 |
oct | 666140067263761 |
9 | 127550364281274 |
10 | 30112030222321 |
11 | 965a493050253 |
12 | 3463ab5bb3841 |
13 | 13a5724435728 |
14 | 761604054ca5 |
15 | 37343a253c81 |
hex | 1b6300dd67f1 |
30112030222321 has 8 divisors (see below), whose sum is σ = 30124750256480. Its totient is φ = 30099312669888.
The previous prime is 30112030222319. The next prime is 30112030222349. The reversal of 30112030222321 is 12322203021103.
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 30112030222321 - 21 = 30112030222319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30112030222292 and 30112030222301.
It is not an unprimeable number, because it can be changed into a prime (30112030222121) 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, 23855170 + ... + 25085716.
It is an arithmetic number, because the mean of its divisors is an integer number (3765593782060).
Almost surely, 230112030222321 is an apocalyptic number.
It is an amenable number.
30112030222321 is a deficient number, since it is larger than the sum of its proper divisors (12720034159).
30112030222321 is a wasteful number, since it uses less digits than its factorization.
30112030222321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1240863.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 30112030222321 its reverse (12322203021103), we get a palindrome (42434233243424).
The spelling of 30112030222321 in words is "thirty trillion, one hundred twelve billion, thirty million, two hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •