Base | Representation |
---|---|
bin | 11100001001110111… |
… | …011100100111000001 |
3 | 2220000210122102010021 |
4 | 130021313130213001 |
5 | 443402424113441 |
6 | 21515420133441 |
7 | 2120064214456 |
oct | 341167344701 |
9 | 86023572107 |
10 | 30230301121 |
11 | 11903242739 |
12 | 5a38097281 |
13 | 2b09ccb457 |
14 | 166ac7782d |
15 | bbde6b3d1 |
hex | 709ddc9c1 |
30230301121 has 2 divisors, whose sum is σ = 30230301122. Its totient is φ = 30230301120.
The previous prime is 30230301043. The next prime is 30230301149. The reversal of 30230301121 is 12110303203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19572010000 + 10658291121 = 139900^2 + 103239^2 .
It is an emirp because it is prime and its reverse (12110303203) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30230301121 is a prime.
It is a super-2 number, since 2×302303011212 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30230301095 and 30230301104.
It is not a weakly prime, because it can be changed into another prime (30230301151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15115150560 + 15115150561.
It is an arithmetic number, because the mean of its divisors is an integer number (15115150561).
Almost surely, 230230301121 is an apocalyptic number.
It is an amenable number.
30230301121 is a deficient number, since it is larger than the sum of its proper divisors (1).
30230301121 is an equidigital number, since it uses as much as digits as its factorization.
30230301121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 30230301121 its reverse (12110303203), we get a palindrome (42340604324).
The spelling of 30230301121 in words is "thirty billion, two hundred thirty million, three hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •