Base | Representation |
---|---|
bin | 1011111001000001010110… |
… | …0010100110110111100011 |
3 | 1201021212220101121220100202 |
4 | 2332100111202212313203 |
5 | 3203202021402431114 |
6 | 43450120200535415 |
7 | 2516403621013304 |
oct | 276202542466743 |
9 | 51255811556322 |
10 | 13074241842659 |
11 | 4190833747a58 |
12 | 1571a6118156b |
13 | 73ab84b6bc2a |
14 | 332b221467ab |
15 | 17a15738ecde |
hex | be4158a6de3 |
13074241842659 has 2 divisors, whose sum is σ = 13074241842660. Its totient is φ = 13074241842658.
The previous prime is 13074241842637. The next prime is 13074241842679. The reversal of 13074241842659 is 95624814247031.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13074241842659 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (13074241842619) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6537120921329 + 6537120921330.
It is an arithmetic number, because the mean of its divisors is an integer number (6537120921330).
It is a 1-persistent number, because it is pandigital, but 2⋅13074241842659 = 26148483685318 is not.
Almost surely, 213074241842659 is an apocalyptic number.
13074241842659 is a deficient number, since it is larger than the sum of its proper divisors (1).
13074241842659 is an equidigital number, since it uses as much as digits as its factorization.
13074241842659 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11612160, while the sum is 56.
The spelling of 13074241842659 in words is "thirteen trillion, seventy-four billion, two hundred forty-one million, eight hundred forty-two thousand, six hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •