Base | Representation |
---|---|
bin | 1101101001101100110110… |
… | …01100010101010010000001 |
3 | 10221021220012111002110211002 |
4 | 12310312123030111102001 |
5 | 12413322211303224441 |
6 | 143503020221501345 |
7 | 6215611544610032 |
oct | 664663314252201 |
9 | 127256174073732 |
10 | 30020130133121 |
11 | 9624513923007 |
12 | 344a128a11855 |
13 | 1399b69a7b11b |
14 | 75ada6a68a89 |
15 | 370d5c19cb9b |
hex | 1b4d9b315481 |
30020130133121 has 2 divisors, whose sum is σ = 30020130133122. Its totient is φ = 30020130133120.
The previous prime is 30020130133069. The next prime is 30020130133129. The reversal of 30020130133121 is 12133103102003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19637305960000 + 10382824173121 = 4431400^2 + 3222239^2 .
It is a cyclic number.
It is not a de Polignac number, because 30020130133121 - 214 = 30020130116737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30020130133093 and 30020130133102.
It is not a weakly prime, because it can be changed into another prime (30020130133129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15010065066560 + 15010065066561.
It is an arithmetic number, because the mean of its divisors is an integer number (15010065066561).
Almost surely, 230020130133121 is an apocalyptic number.
It is an amenable number.
30020130133121 is a deficient number, since it is larger than the sum of its proper divisors (1).
30020130133121 is an equidigital number, since it uses as much as digits as its factorization.
30020130133121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 30020130133121 its reverse (12133103102003), we get a palindrome (42153233235124).
The spelling of 30020130133121 in words is "thirty trillion, twenty billion, one hundred thirty million, one hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •