Base | Representation |
---|---|
bin | 11000011101010111… |
… | …01001100000101011 |
3 | 1020220010201100111112 |
4 | 30032223221200223 |
5 | 203343043201011 |
6 | 10010555420535 |
7 | 643255400123 |
oct | 141653514053 |
9 | 36803640445 |
10 | 13131225131 |
11 | 5629263882 |
12 | 266575474b |
13 | 1313628ccb |
14 | 8c7d67c83 |
15 | 51cc2358b |
hex | 30eae982b |
13131225131 has 2 divisors, whose sum is σ = 13131225132. Its totient is φ = 13131225130.
The previous prime is 13131225059. The next prime is 13131225137. The reversal of 13131225131 is 13152213131.
13131225131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13131225131 - 210 = 13131224107 is a prime.
It is a super-2 number, since 2×131312251312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13131225097 and 13131225106.
It is not a weakly prime, because it can be changed into another prime (13131225137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565612565 + 6565612566.
It is an arithmetic number, because the mean of its divisors is an integer number (6565612566).
Almost surely, 213131225131 is an apocalyptic number.
13131225131 is a deficient number, since it is larger than the sum of its proper divisors (1).
13131225131 is an equidigital number, since it uses as much as digits as its factorization.
13131225131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 540, while the sum is 23.
Adding to 13131225131 its reverse (13152213131), we get a palindrome (26283438262).
The spelling of 13131225131 in words is "thirteen billion, one hundred thirty-one million, two hundred twenty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •