Base | Representation |
---|---|
bin | 100110101100110110111… |
… | …0110000010110011010001 |
3 | 200211111022010012221202001 |
4 | 1031121231312002303101 |
5 | 1144121314133134431 |
6 | 15151304235154001 |
7 | 1056200041250245 |
oct | 115315566026321 |
9 | 20744263187661 |
10 | 5319012396241 |
11 | 1770864916525 |
12 | 71aa3a5a5901 |
13 | 2c7771ab0a7b |
14 | 14562796c425 |
15 | 9355e0b7e61 |
hex | 4d66dd82cd1 |
5319012396241 has 2 divisors, whose sum is σ = 5319012396242. Its totient is φ = 5319012396240.
The previous prime is 5319012396223. The next prime is 5319012396251. The reversal of 5319012396241 is 1426932109135.
5319012396241 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4124571057216 + 1194441339025 = 2030904^2 + 1092905^2 .
It is a cyclic number.
It is not a de Polignac number, because 5319012396241 - 227 = 5318878178513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5319012396191 and 5319012396200.
It is not a weakly prime, because it can be changed into another prime (5319012396251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2659506198120 + 2659506198121.
It is an arithmetic number, because the mean of its divisors is an integer number (2659506198121).
Almost surely, 25319012396241 is an apocalyptic number.
It is an amenable number.
5319012396241 is a deficient number, since it is larger than the sum of its proper divisors (1).
5319012396241 is an equidigital number, since it uses as much as digits as its factorization.
5319012396241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 349920, while the sum is 46.
The spelling of 5319012396241 in words is "five trillion, three hundred nineteen billion, twelve million, three hundred ninety-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •