Base | Representation |
---|---|
bin | 11000001110111010… |
… | …11001111001110111 |
3 | 1020120200201001101212 |
4 | 30013131121321313 |
5 | 203121033110204 |
6 | 5550550312035 |
7 | 640254414623 |
oct | 140735317167 |
9 | 36520631355 |
10 | 13010050679 |
11 | 557691a6aa |
12 | 263105861b |
13 | 12c44b0652 |
14 | 8b5c24183 |
15 | 512289c6e |
hex | 307759e77 |
13010050679 has 2 divisors, whose sum is σ = 13010050680. Its totient is φ = 13010050678.
The previous prime is 13010050637. The next prime is 13010050681. The reversal of 13010050679 is 97605001031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13010050679 - 212 = 13010046583 is a prime.
It is a super-2 number, since 2×130100506792 (a number of 21 digits) contains 22 as substring.
Together with 13010050681, 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 (13010050379) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6505025339 + 6505025340.
It is an arithmetic number, because the mean of its divisors is an integer number (6505025340).
Almost surely, 213010050679 is an apocalyptic number.
13010050679 is a deficient number, since it is larger than the sum of its proper divisors (1).
13010050679 is an equidigital number, since it uses as much as digits as its factorization.
13010050679 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 32.
The spelling of 13010050679 in words is "thirteen billion, ten million, fifty thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •