Base | Representation |
---|---|
bin | 11101101000011011001100… |
… | …100110101010100100011101 |
3 | 122002102121010120211001100001 |
4 | 131220123030212222210131 |
5 | 114040141041034230013 |
6 | 1141100443115134301 |
7 | 36310256024664061 |
oct | 3550331446524435 |
9 | 562377116731301 |
10 | 130321330383133 |
11 | 38584a6959303a |
12 | 12749191a44391 |
13 | 57943305a3b76 |
14 | 242782c175aa1 |
15 | 100ee546b5ddd |
hex | 7686cc9aa91d |
130321330383133 has 2 divisors, whose sum is σ = 130321330383134. Its totient is φ = 130321330383132.
The previous prime is 130321330383047. The next prime is 130321330383161. The reversal of 130321330383133 is 331383033123031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129174090168484 + 1147240214649 = 11365478^2 + 1071093^2 .
It is a cyclic number.
It is not a de Polignac number, because 130321330383133 - 213 = 130321330374941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130321330383092 and 130321330383101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130321330383173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65160665191566 + 65160665191567.
It is an arithmetic number, because the mean of its divisors is an integer number (65160665191567).
Almost surely, 2130321330383133 is an apocalyptic number.
It is an amenable number.
130321330383133 is a deficient number, since it is larger than the sum of its proper divisors (1).
130321330383133 is an equidigital number, since it uses as much as digits as its factorization.
130321330383133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 104976, while the sum is 37.
The spelling of 130321330383133 in words is "one hundred thirty trillion, three hundred twenty-one billion, three hundred thirty million, three hundred eighty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •