Base | Representation |
---|---|
bin | 1101101111101010100010… |
… | …11001101000000011111101 |
3 | 10222000111010201222102121022 |
4 | 12313311101121220003331 |
5 | 12430201400414043031 |
6 | 144141110241113525 |
7 | 6236454633355361 |
oct | 667652131500375 |
9 | 128014121872538 |
10 | 30225050534141 |
11 | 96a3410074331 |
12 | 34819983288a5 |
13 | 13b32965a9198 |
14 | 766c8640b2a1 |
15 | 3763525a397b |
hex | 1b7d516680fd |
30225050534141 has 2 divisors, whose sum is σ = 30225050534142. Its totient is φ = 30225050534140.
The previous prime is 30225050534117. The next prime is 30225050534243. The reversal of 30225050534141 is 14143505052203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23711504346916 + 6513546187225 = 4869446^2 + 2552165^2 .
It is an emirp because it is prime and its reverse (14143505052203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30225050534141 - 214 = 30225050517757 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30225050534111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15112525267070 + 15112525267071.
It is an arithmetic number, because the mean of its divisors is an integer number (15112525267071).
Almost surely, 230225050534141 is an apocalyptic number.
It is an amenable number.
30225050534141 is a deficient number, since it is larger than the sum of its proper divisors (1).
30225050534141 is an equidigital number, since it uses as much as digits as its factorization.
30225050534141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 30225050534141 its reverse (14143505052203), we get a palindrome (44368555586344).
The spelling of 30225050534141 in words is "thirty trillion, two hundred twenty-five billion, fifty million, five hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •