Base | Representation |
---|---|
bin | 1011111010101000110111… |
… | …1110110101000100000011 |
3 | 1201101112122011021221110121 |
4 | 2332222031332311010003 |
5 | 3204130430232414111 |
6 | 43510553543041111 |
7 | 2521406401052443 |
oct | 276521576650403 |
9 | 51345564257417 |
10 | 13102032310531 |
11 | 41a15a474087a |
12 | 1577318140197 |
13 | 740693545a68 |
14 | 3341dad52123 |
15 | 17ac32017871 |
hex | bea8dfb5103 |
13102032310531 has 2 divisors, whose sum is σ = 13102032310532. Its totient is φ = 13102032310530.
The previous prime is 13102032310529. The next prime is 13102032310567. The reversal of 13102032310531 is 13501323020131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13102032310531 - 21 = 13102032310529 is a prime.
It is a super-2 number, since 2×131020323105312 (a number of 27 digits) contains 22 as substring.
Together with 13102032310529, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 13102032310496 and 13102032310505.
It is not a weakly prime, because it can be changed into another prime (13102032310231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551016155265 + 6551016155266.
It is an arithmetic number, because the mean of its divisors is an integer number (6551016155266).
Almost surely, 213102032310531 is an apocalyptic number.
13102032310531 is a deficient number, since it is larger than the sum of its proper divisors (1).
13102032310531 is an equidigital number, since it uses as much as digits as its factorization.
13102032310531 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 13102032310531 its reverse (13501323020131), we get a palindrome (26603355330662).
The spelling of 13102032310531 in words is "thirteen trillion, one hundred two billion, thirty-two million, three hundred ten thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •