Base | Representation |
---|---|
bin | 1101110010001110011011… |
… | …11111001110111101001001 |
3 | 10222022220020212220012001012 |
4 | 12321013031333032331021 |
5 | 12433122101232112411 |
6 | 144245341323133305 |
7 | 6246021251426246 |
oct | 671071577167511 |
9 | 128286225805035 |
10 | 30313040113481 |
11 | 9727762980644 |
12 | 3496a53974235 |
13 | 13bb679a45c28 |
14 | 76b2322da5cd |
15 | 3787a21b018b |
hex | 1b91cdfcef49 |
30313040113481 has 2 divisors, whose sum is σ = 30313040113482. Its totient is φ = 30313040113480.
The previous prime is 30313040113427. The next prime is 30313040113519. The reversal of 30313040113481 is 18431104031303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22652649870400 + 7660390243081 = 4759480^2 + 2767741^2 .
It is a cyclic number.
It is not a de Polignac number, because 30313040113481 - 214 = 30313040097097 is a prime.
It is a super-2 number, since 2×303130401134812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30313040118481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15156520056740 + 15156520056741.
It is an arithmetic number, because the mean of its divisors is an integer number (15156520056741).
Almost surely, 230313040113481 is an apocalyptic number.
It is an amenable number.
30313040113481 is a deficient number, since it is larger than the sum of its proper divisors (1).
30313040113481 is an equidigital number, since it uses as much as digits as its factorization.
30313040113481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 30313040113481 its reverse (18431104031303), we get a palindrome (48744144144784).
The spelling of 30313040113481 in words is "thirty trillion, three hundred thirteen billion, forty million, one hundred thirteen thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •