Base | Representation |
---|---|
bin | 100100110000001101010… |
… | …1110110010110001111011 |
3 | 122212220100212121000201002 |
4 | 1021200122232302301323 |
5 | 1130230110440424311 |
6 | 14424314324515215 |
7 | 1030642444453526 |
oct | 111403256626173 |
9 | 18786325530632 |
10 | 5051330014331 |
11 | 1678291118007 |
12 | 696b9424bb0b |
13 | 2a845254a603 |
14 | 1366b29abbbd |
15 | 8b5e3c3493b |
hex | 4981abb2c7b |
5051330014331 has 2 divisors, whose sum is σ = 5051330014332. Its totient is φ = 5051330014330.
The previous prime is 5051330014319. The next prime is 5051330014343. The reversal of 5051330014331 is 1334100331505.
It is a balanced prime because it is at equal distance from previous prime (5051330014319) and next prime (5051330014343).
It is a cyclic number.
It is not a de Polignac number, because 5051330014331 - 210 = 5051330013307 is a prime.
It is a super-2 number, since 2×50513300143312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5051330014294 and 5051330014303.
It is not a weakly prime, because it can be changed into another prime (5051330014351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525665007165 + 2525665007166.
It is an arithmetic number, because the mean of its divisors is an integer number (2525665007166).
Almost surely, 25051330014331 is an apocalyptic number.
5051330014331 is a deficient number, since it is larger than the sum of its proper divisors (1).
5051330014331 is an equidigital number, since it uses as much as digits as its factorization.
5051330014331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8100, while the sum is 29.
Adding to 5051330014331 its reverse (1334100331505), we get a palindrome (6385430345836).
The spelling of 5051330014331 in words is "five trillion, fifty-one billion, three hundred thirty million, fourteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •