Base | Representation |
---|---|
bin | 1100010010101011010011… |
… | …0011010001010000100011 |
3 | 1202212000120121201011102011 |
4 | 3010222310303101100203 |
5 | 3232412210103432011 |
6 | 44424412215333351 |
7 | 2563266211252453 |
oct | 304526463212043 |
9 | 52760517634364 |
10 | 13515000452131 |
11 | 4340752468972 |
12 | 162336a381257 |
13 | 7705c777cc69 |
14 | 34a1b5549d63 |
15 | 18685216d621 |
hex | c4ab4cd1423 |
13515000452131 has 2 divisors, whose sum is σ = 13515000452132. Its totient is φ = 13515000452130.
The previous prime is 13515000452099. The next prime is 13515000452147. The reversal of 13515000452131 is 13125400051531.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13515000452131 - 25 = 13515000452099 is a prime.
It is a super-2 number, since 2×135150004521312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13515000452093 and 13515000452102.
It is not a weakly prime, because it can be changed into another prime (13515000452531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6757500226065 + 6757500226066.
It is an arithmetic number, because the mean of its divisors is an integer number (6757500226066).
Almost surely, 213515000452131 is an apocalyptic number.
13515000452131 is a deficient number, since it is larger than the sum of its proper divisors (1).
13515000452131 is an equidigital number, since it uses as much as digits as its factorization.
13515000452131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 13515000452131 in words is "thirteen trillion, five hundred fifteen billion, four hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •