Base | Representation |
---|---|
bin | 1101101100000001110111… |
… | …01100000111010001001101 |
3 | 10221120112200222011002111102 |
4 | 12312000323230013101031 |
5 | 12421130032322331341 |
6 | 144003450532232445 |
7 | 6224443223324444 |
oct | 666007354072115 |
9 | 127515628132442 |
10 | 30100132230221 |
11 | 9655437a31729 |
12 | 346173546b725 |
13 | 13a4579468611 |
14 | 760bd5bcbd5b |
15 | 372e90932c9b |
hex | 1b603bb0744d |
30100132230221 has 2 divisors, whose sum is σ = 30100132230222. Its totient is φ = 30100132230220.
The previous prime is 30100132230193. The next prime is 30100132230229. The reversal of 30100132230221 is 12203223100103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28809895225225 + 1290237004996 = 5367485^2 + 1135886^2 .
It is a cyclic number.
It is not a de Polignac number, because 30100132230221 - 234 = 30082952361037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30100132230193 and 30100132230202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30100132230229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15050066115110 + 15050066115111.
It is an arithmetic number, because the mean of its divisors is an integer number (15050066115111).
Almost surely, 230100132230221 is an apocalyptic number.
It is an amenable number.
30100132230221 is a deficient number, since it is larger than the sum of its proper divisors (1).
30100132230221 is an equidigital number, since it uses as much as digits as its factorization.
30100132230221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 30100132230221 its reverse (12203223100103), we get a palindrome (42303355330324).
The spelling of 30100132230221 in words is "thirty trillion, one hundred billion, one hundred thirty-two million, two hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •