Base | Representation |
---|---|
bin | 1101110000000110111101… |
… | …00001111110111101010101 |
3 | 10222001221111201120212110202 |
4 | 12320003132201332331111 |
5 | 12430424120110330141 |
6 | 144152111543030245 |
7 | 6240534622122116 |
oct | 670033641767525 |
9 | 128057451525422 |
10 | 30240303214421 |
11 | 96a992788a823 |
12 | 348493443b385 |
13 | 13b48575958a1 |
14 | 7678d200820d |
15 | 37694667b49b |
hex | 1b80de87ef55 |
30240303214421 has 2 divisors, whose sum is σ = 30240303214422. Its totient is φ = 30240303214420.
The previous prime is 30240303214369. The next prime is 30240303214423. The reversal of 30240303214421 is 12441230304203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25720061535025 + 4520241679396 = 5071495^2 + 2126086^2 .
It is a cyclic number.
It is not a de Polignac number, because 30240303214421 - 234 = 30223123345237 is a prime.
Together with 30240303214423, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30240303214423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15120151607210 + 15120151607211.
It is an arithmetic number, because the mean of its divisors is an integer number (15120151607211).
Almost surely, 230240303214421 is an apocalyptic number.
It is an amenable number.
30240303214421 is a deficient number, since it is larger than the sum of its proper divisors (1).
30240303214421 is an equidigital number, since it uses as much as digits as its factorization.
30240303214421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 30240303214421 its reverse (12441230304203), we get a palindrome (42681533518624).
The spelling of 30240303214421 in words is "thirty trillion, two hundred forty billion, three hundred three million, two hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •