Base | Representation |
---|---|
bin | 1011110101111100001000… |
… | …0001110001111110100001 |
3 | 1201002211020212022120220021 |
4 | 2331133002001301332201 |
5 | 3201320111041332204 |
6 | 43405523025313441 |
7 | 2512520660214643 |
oct | 275370201617641 |
9 | 51084225276807 |
10 | 13021301120929 |
11 | 4170337022172 |
12 | 1563747495881 |
13 | 735b98aa129a |
14 | 33033d040893 |
15 | 178aa9765154 |
hex | bd7c2071fa1 |
13021301120929 has 2 divisors, whose sum is σ = 13021301120930. Its totient is φ = 13021301120928.
The previous prime is 13021301120911. The next prime is 13021301121019. The reversal of 13021301120929 is 92902110312031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13015694106529 + 5607014400 = 3607727^2 + 74880^2 .
It is a cyclic number.
It is not a de Polignac number, because 13021301120929 - 225 = 13021267566497 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13021301120894 and 13021301120903.
It is not a weakly prime, because it can be changed into another prime (13021301120909) 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, 6510650560464 + 6510650560465.
It is an arithmetic number, because the mean of its divisors is an integer number (6510650560465).
Almost surely, 213021301120929 is an apocalyptic number.
It is an amenable number.
13021301120929 is a deficient number, since it is larger than the sum of its proper divisors (1).
13021301120929 is an equidigital number, since it uses as much as digits as its factorization.
13021301120929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 34.
The spelling of 13021301120929 in words is "thirteen trillion, twenty-one billion, three hundred one million, one hundred twenty thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •