Base | Representation |
---|---|
bin | 1011111010100001101011… |
… | …1000100111001110001001 |
3 | 1201101100122120202111112212 |
4 | 2332220122320213032021 |
5 | 3204113001413114004 |
6 | 43510034202514505 |
7 | 2521310502541433 |
oct | 276503270471611 |
9 | 51340576674485 |
10 | 13100101301129 |
11 | 41a07a3735937 |
12 | 1576a79505a35 |
13 | 74044647594b |
14 | 3340966d5653 |
15 | 17ab6c73196e |
hex | bea1ae27389 |
13100101301129 has 2 divisors, whose sum is σ = 13100101301130. Its totient is φ = 13100101301128.
The previous prime is 13100101301099. The next prime is 13100101301227. The reversal of 13100101301129 is 92110310100131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7749392115529 + 5350709185600 = 2783773^2 + 2313160^2 .
It is a cyclic number.
It is not a de Polignac number, because 13100101301129 - 220 = 13100100252553 is a prime.
It is a super-2 number, since 2×131001013011292 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13100101301029) 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, 6550050650564 + 6550050650565.
It is an arithmetic number, because the mean of its divisors is an integer number (6550050650565).
Almost surely, 213100101301129 is an apocalyptic number.
It is an amenable number.
13100101301129 is a deficient number, since it is larger than the sum of its proper divisors (1).
13100101301129 is an equidigital number, since it uses as much as digits as its factorization.
13100101301129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 23.
The spelling of 13100101301129 in words is "thirteen trillion, one hundred billion, one hundred one million, three hundred one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •