Base | Representation |
---|---|
bin | 1001100000110100… |
… | …11110011100111101 |
3 | 111011221010100201022 |
4 | 10300122132130331 |
5 | 40424421323031 |
6 | 2202441153525 |
7 | 240363414101 |
oct | 46032363475 |
9 | 14157110638 |
10 | 5107214141 |
11 | 2190986637 |
12 | ba648b8a5 |
13 | 635129c03 |
14 | 36640d901 |
15 | 1ed58397b |
hex | 13069e73d |
5107214141 has 2 divisors, whose sum is σ = 5107214142. Its totient is φ = 5107214140.
The previous prime is 5107214093. The next prime is 5107214149. The reversal of 5107214141 is 1414127015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3934425625 + 1172788516 = 62725^2 + 34246^2 .
It is a cyclic number.
It is not a de Polignac number, because 5107214141 - 214 = 5107197757 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5107214141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5107214149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2553607070 + 2553607071.
It is an arithmetic number, because the mean of its divisors is an integer number (2553607071).
Almost surely, 25107214141 is an apocalyptic number.
It is an amenable number.
5107214141 is a deficient number, since it is larger than the sum of its proper divisors (1).
5107214141 is an equidigital number, since it uses as much as digits as its factorization.
5107214141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1120, while the sum is 26.
The square root of 5107214141 is about 71464.7755261290. The cubic root of 5107214141 is about 1722.1118530711. Note that the first 3 decimals are identical.
The spelling of 5107214141 in words is "five billion, one hundred seven million, two hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •