Base | Representation |
---|---|
bin | 11000100101101011… |
… | …11100101110010011 |
3 | 1021002000002000110001 |
4 | 30102311330232103 |
5 | 204013431043011 |
6 | 10021531550431 |
7 | 645063636655 |
oct | 142265745623 |
9 | 37060060401 |
10 | 13201034131 |
11 | 566470436a |
12 | 2684bbb417 |
13 | 1324c2b8cc |
14 | 8d333a6d5 |
15 | 523e127c1 |
hex | 312d7cb93 |
13201034131 has 4 divisors (see below), whose sum is σ = 13201906032. Its totient is φ = 13200162232.
The previous prime is 13201034107. The next prime is 13201034137. The reversal of 13201034131 is 13143010231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13201034131 - 217 = 13200903059 is a prime.
It is a super-2 number, since 2×132010341312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13201034099 and 13201034108.
It is not an unprimeable number, because it can be changed into a prime (13201034137) 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 in 3 ways as a sum of consecutive naturals, for example, 412831 + ... + 443656.
It is an arithmetic number, because the mean of its divisors is an integer number (3300476508).
Almost surely, 213201034131 is an apocalyptic number.
13201034131 is a deficient number, since it is larger than the sum of its proper divisors (871901).
13201034131 is an equidigital number, since it uses as much as digits as its factorization.
13201034131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 871900.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13201034131 its reverse (13143010231), we get a palindrome (26344044362).
The spelling of 13201034131 in words is "thirteen billion, two hundred one million, thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •