Base | Representation |
---|---|
bin | 1101110100110100011001… |
… | …11001001011010110010101 |
3 | 10222122102020120102021001220 |
4 | 12322122030321023112111 |
5 | 12441102041413220041 |
6 | 144354315032440553 |
7 | 6255324266614203 |
oct | 672321471132625 |
9 | 128572216367056 |
10 | 30402142320021 |
11 | 976152683716a |
12 | 34b017bb49159 |
13 | 13c6ba9864c74 |
14 | 771685c94073 |
15 | 37ac697e8d66 |
hex | 1ba68ce4b595 |
30402142320021 has 8 divisors (see below), whose sum is σ = 40540585869984. Its totient is φ = 20265896825040.
The previous prime is 30402142319953. The next prime is 30402142320047. The reversal of 30402142320021 is 12002324120403.
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 30402142320021 - 27 = 30402142319893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30402142319973 and 30402142320000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30402142320521) 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, 549481471 + ... + 549536796.
It is an arithmetic number, because the mean of its divisors is an integer number (5067573233748).
Almost surely, 230402142320021 is an apocalyptic number.
It is an amenable number.
30402142320021 is a deficient number, since it is larger than the sum of its proper divisors (10138443549963).
30402142320021 is a wasteful number, since it uses less digits than its factorization.
30402142320021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1099027491.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 30402142320021 its reverse (12002324120403), we get a palindrome (42404466440424).
The spelling of 30402142320021 in words is "thirty trillion, four hundred two billion, one hundred forty-two million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •