Base | Representation |
---|---|
bin | 1011111100100100000100… |
… | …1001101001101001100101 |
3 | 1201111200222220201001220112 |
4 | 2333021001021221221211 |
5 | 3210201142334240401 |
6 | 43534103311342405 |
7 | 2523660045446600 |
oct | 277110111515145 |
9 | 51450886631815 |
10 | 13135103040101 |
11 | 4204625264439 |
12 | 1581807521a05 |
13 | 743833b57cb3 |
14 | 335a57135337 |
15 | 17ba1a5073bb |
hex | bf241269a65 |
13135103040101 has 6 divisors (see below), whose sum is σ = 15279609658950. Its totient is φ = 11258659748616.
The previous prime is 13135103040097. The next prime is 13135103040131. The reversal of 13135103040101 is 10104030153131.
It can be written as a sum of positive squares in only one way, i.e., 12413121447076 + 721981593025 = 3523226^2 + 849695^2 .
It is not a de Polignac number, because 13135103040101 - 22 = 13135103040097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13135103040131) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 134031663626 + ... + 134031663723.
It is an arithmetic number, because the mean of its divisors is an integer number (2546601609825).
Almost surely, 213135103040101 is an apocalyptic number.
It is an amenable number.
13135103040101 is a deficient number, since it is larger than the sum of its proper divisors (2144506618849).
13135103040101 is an equidigital number, since it uses as much as digits as its factorization.
13135103040101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268063327363 (or 268063327356 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 13135103040101 its reverse (10104030153131), we get a palindrome (23239133193232).
The spelling of 13135103040101 in words is "thirteen trillion, one hundred thirty-five billion, one hundred three million, forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •