Base | Representation |
---|---|
bin | 1100001001010011111110… |
… | …0101100011000111001001 |
3 | 1202021122022121000001212112 |
4 | 3002110333211203013021 |
5 | 3222243214223143032 |
6 | 44222444215552105 |
7 | 2545542355141421 |
oct | 302247745430711 |
9 | 52248277001775 |
10 | 13354120131017 |
11 | 42894a57444a6 |
12 | 15b814b98b635 |
13 | 75b399019b93 |
14 | 3424b2b5d481 |
15 | 1825882901b2 |
hex | c253f9631c9 |
13354120131017 has 2 divisors, whose sum is σ = 13354120131018. Its totient is φ = 13354120131016.
The previous prime is 13354120130999. The next prime is 13354120131061. The reversal of 13354120131017 is 71013102145331.
13354120131017 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11792829896761 + 1561290234256 = 3434069^2 + 1249516^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13354120131017 is a prime.
It is not a weakly prime, because it can be changed into another prime (13354120131067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6677060065508 + 6677060065509.
It is an arithmetic number, because the mean of its divisors is an integer number (6677060065509).
Almost surely, 213354120131017 is an apocalyptic number.
It is an amenable number.
13354120131017 is a deficient number, since it is larger than the sum of its proper divisors (1).
13354120131017 is an equidigital number, since it uses as much as digits as its factorization.
13354120131017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7560, while the sum is 32.
Adding to 13354120131017 its reverse (71013102145331), we get a palindrome (84367222276348).
The spelling of 13354120131017 in words is "thirteen trillion, three hundred fifty-four billion, one hundred twenty million, one hundred thirty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •