Base | Representation |
---|---|
bin | 1001000110111101011000… |
… | …11011101010011100011001 |
3 | 2121220212202211010011202001 |
4 | 10203132230123222130121 |
5 | 10111134101302343022 |
6 | 110333445433241001 |
7 | 4135100064661204 |
oct | 443365433523431 |
9 | 77825684104661 |
10 | 20030325434137 |
11 | 64228a45775a7 |
12 | 22b6017563161 |
13 | b23b0bc105c5 |
14 | 4d36899ba93b |
15 | 24b07c344b27 |
hex | 1237ac6ea719 |
20030325434137 has 2 divisors, whose sum is σ = 20030325434138. Its totient is φ = 20030325434136.
The previous prime is 20030325434027. The next prime is 20030325434179. The reversal of 20030325434137 is 73143452303002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19665003106576 + 365322327561 = 4434524^2 + 604419^2 .
It is a cyclic number.
It is not a de Polignac number, because 20030325434137 - 239 = 19480569620249 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20030325434096 and 20030325434105.
It is not a weakly prime, because it can be changed into another prime (20030325434237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10015162717068 + 10015162717069.
It is an arithmetic number, because the mean of its divisors is an integer number (10015162717069).
Almost surely, 220030325434137 is an apocalyptic number.
It is an amenable number.
20030325434137 is a deficient number, since it is larger than the sum of its proper divisors (1).
20030325434137 is an equidigital number, since it uses as much as digits as its factorization.
20030325434137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 181440, while the sum is 37.
Adding to 20030325434137 its reverse (73143452303002), we get a palindrome (93173777737139).
The spelling of 20030325434137 in words is "twenty trillion, thirty billion, three hundred twenty-five million, four hundred thirty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •