Base | Representation |
---|---|
bin | 1011111100010101001100… |
… | …1011011001011000001111 |
3 | 1201111022200200002001102002 |
4 | 2333011103023121120033 |
5 | 3210120003243122320 |
6 | 43532203210022515 |
7 | 2523456105546353 |
oct | 277052313313017 |
9 | 51438620061362 |
10 | 13131110520335 |
11 | 420296661a225 |
12 | 1580a92417a3b |
13 | 743348955272 |
14 | 335798bab463 |
15 | 17b884c5d675 |
hex | bf1532d960f |
13131110520335 has 8 divisors (see below), whose sum is σ = 15956792531520. Its totient is φ = 10371915144864.
The previous prime is 13131110520331. The next prime is 13131110520337. The reversal of 13131110520335 is 53302501113131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13131110520335 - 22 = 13131110520331 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13131110520298 and 13131110520307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13131110520331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16621658492 + ... + 16621659281.
It is an arithmetic number, because the mean of its divisors is an integer number (1994599066440).
Almost surely, 213131110520335 is an apocalyptic number.
13131110520335 is a deficient number, since it is larger than the sum of its proper divisors (2825682011185).
13131110520335 is an equidigital number, since it uses as much as digits as its factorization.
13131110520335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33243317857.
The product of its (nonzero) digits is 4050, while the sum is 29.
Adding to 13131110520335 its reverse (53302501113131), we get a palindrome (66433611633466).
The spelling of 13131110520335 in words is "thirteen trillion, one hundred thirty-one billion, one hundred ten million, five hundred twenty thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •