Base | Representation |
---|---|
bin | 100100110110111000111… |
… | …1010011001001101000101 |
3 | 122221021101210001121212021 |
4 | 1021231301322121031011 |
5 | 1130444001424344411 |
6 | 14435050134523141 |
7 | 1031661132636442 |
oct | 111556172311505 |
9 | 18837353047767 |
10 | 5065677574981 |
11 | 1683383a24751 |
12 | 6999192064b1 |
13 | 2a98cab6a27a |
14 | 1372742b89c9 |
15 | 8bb8361da71 |
hex | 49b71e99345 |
5065677574981 has 2 divisors, whose sum is σ = 5065677574982. Its totient is φ = 5065677574980.
The previous prime is 5065677574963. The next prime is 5065677575027. The reversal of 5065677574981 is 1894757765605.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5058045980100 + 7631594881 = 2249010^2 + 87359^2 .
It is a cyclic number.
It is not a de Polignac number, because 5065677574981 - 29 = 5065677574469 is a prime.
It is a super-2 number, since 2×50656775749812 (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 5065677574981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5065677578981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2532838787490 + 2532838787491.
It is an arithmetic number, because the mean of its divisors is an integer number (2532838787491).
Almost surely, 25065677574981 is an apocalyptic number.
It is an amenable number.
5065677574981 is a deficient number, since it is larger than the sum of its proper divisors (1).
5065677574981 is an equidigital number, since it uses as much as digits as its factorization.
5065677574981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 444528000, while the sum is 70.
The spelling of 5065677574981 in words is "five trillion, sixty-five billion, six hundred seventy-seven million, five hundred seventy-four thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •