Base | Representation |
---|---|
bin | 1011111100010101001101… |
… | …0001110100001011011001 |
3 | 1201111022200210020112112212 |
4 | 2333011103101310023121 |
5 | 3210120004210443334 |
6 | 43532203310044505 |
7 | 2523456126055115 |
oct | 277052321641331 |
9 | 51438623215485 |
10 | 13131112202969 |
11 | 4202967569432 |
12 | 1580a92aa9735 |
13 | 7433490c40c7 |
14 | 3357990c8745 |
15 | 17b884e91ece |
hex | bf1534742d9 |
13131112202969 has 2 divisors, whose sum is σ = 13131112202970. Its totient is φ = 13131112202968.
The previous prime is 13131112202959. The next prime is 13131112203037. The reversal of 13131112202969 is 96920221113131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8832070734400 + 4299041468569 = 2971880^2 + 2073413^2 .
It is a cyclic number.
It is not a de Polignac number, because 13131112202969 - 24 = 13131112202953 is a prime.
It is a super-2 number, since 2×131311122029692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13131112202939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565556101484 + 6565556101485.
It is an arithmetic number, because the mean of its divisors is an integer number (6565556101485).
Almost surely, 213131112202969 is an apocalyptic number.
It is an amenable number.
13131112202969 is a deficient number, since it is larger than the sum of its proper divisors (1).
13131112202969 is an equidigital number, since it uses as much as digits as its factorization.
13131112202969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 41.
The spelling of 13131112202969 in words is "thirteen trillion, one hundred thirty-one billion, one hundred twelve million, two hundred two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •