Base | Representation |
---|---|
bin | 100110110011111111110… |
… | …0000000110101011011101 |
3 | 200212221212101201202000001 |
4 | 1031213333200012223131 |
5 | 1144344212300123011 |
6 | 15202321252534301 |
7 | 1060251641354452 |
oct | 115477740065335 |
9 | 20787771652001 |
10 | 5334341020381 |
11 | 177731049273a |
12 | 7219b8021391 |
13 | 2c904573a579 |
14 | 14627d697829 |
15 | 93b59b927c1 |
hex | 4d9ff806add |
5334341020381 has 2 divisors, whose sum is σ = 5334341020382. Its totient is φ = 5334341020380.
The previous prime is 5334341020367. The next prime is 5334341020387. The reversal of 5334341020381 is 1830201434335.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3777810308281 + 1556530712100 = 1943659^2 + 1247610^2 .
It is a cyclic number.
It is not a de Polignac number, because 5334341020381 - 211 = 5334341018333 is a prime.
It is a super-2 number, since 2×53343410203812 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5334341020381.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5334341020387) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2667170510190 + 2667170510191.
It is an arithmetic number, because the mean of its divisors is an integer number (2667170510191).
Almost surely, 25334341020381 is an apocalyptic number.
It is an amenable number.
5334341020381 is a deficient number, since it is larger than the sum of its proper divisors (1).
5334341020381 is an equidigital number, since it uses as much as digits as its factorization.
5334341020381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 37.
The spelling of 5334341020381 in words is "five trillion, three hundred thirty-four billion, three hundred forty-one million, twenty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •