Base | Representation |
---|---|
bin | 100100101000010010001… |
… | …1100111011100000100111 |
3 | 122211021102221112001011011 |
4 | 1021100210130323200213 |
5 | 1124440233142000341 |
6 | 14412422004123051 |
7 | 1026500655304453 |
oct | 111204434734047 |
9 | 18737387461134 |
10 | 5034313234471 |
11 | 1671049638484 |
12 | 693825396487 |
13 | 2a696cc306c1 |
14 | 13593a9a1663 |
15 | 8ae49d45b81 |
hex | 4942473b827 |
5034313234471 has 2 divisors, whose sum is σ = 5034313234472. Its totient is φ = 5034313234470.
The previous prime is 5034313234469. The next prime is 5034313234481. The reversal of 5034313234471 is 1744323134305.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5034313234471 - 21 = 5034313234469 is a prime.
It is a super-3 number, since 3×50343132344713 (a number of 39 digits) contains 333 as substring.
Together with 5034313234469, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5034313234481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2517156617235 + 2517156617236.
It is an arithmetic number, because the mean of its divisors is an integer number (2517156617236).
Almost surely, 25034313234471 is an apocalyptic number.
5034313234471 is a deficient number, since it is larger than the sum of its proper divisors (1).
5034313234471 is an equidigital number, since it uses as much as digits as its factorization.
5034313234471 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 40.
Adding to 5034313234471 its reverse (1744323134305), we get a palindrome (6778636368776).
The spelling of 5034313234471 in words is "five trillion, thirty-four billion, three hundred thirteen million, two hundred thirty-four thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •