Base | Representation |
---|---|
bin | 100101011010011111000… |
… | …1010111010111000000101 |
3 | 200012120201002220110001102 |
4 | 1022310332022322320011 |
5 | 1133222024414401201 |
6 | 14534131245505445 |
7 | 1040335333336112 |
oct | 112647612727005 |
9 | 20176632813042 |
10 | 5142118903301 |
11 | 1702840080056 |
12 | 6b06b1272285 |
13 | 2b3b909322a3 |
14 | 13ac46581909 |
15 | 8db5949126b |
hex | 4ad3e2bae05 |
5142118903301 has 2 divisors, whose sum is σ = 5142118903302. Its totient is φ = 5142118903300.
The previous prime is 5142118903291. The next prime is 5142118903303. The reversal of 5142118903301 is 1033098112415.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3995401322500 + 1146717580801 = 1998850^2 + 1070849^2 .
It is a cyclic number.
It is not a de Polignac number, because 5142118903301 - 26 = 5142118903237 is a prime.
It is a super-3 number, since 3×51421189033013 (a number of 39 digits) contains 333 as substring.
Together with 5142118903303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5142118903303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2571059451650 + 2571059451651.
It is an arithmetic number, because the mean of its divisors is an integer number (2571059451651).
Almost surely, 25142118903301 is an apocalyptic number.
It is an amenable number.
5142118903301 is a deficient number, since it is larger than the sum of its proper divisors (1).
5142118903301 is an equidigital number, since it uses as much as digits as its factorization.
5142118903301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 38.
The spelling of 5142118903301 in words is "five trillion, one hundred forty-two billion, one hundred eighteen million, nine hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •