Base | Representation |
---|---|
bin | 1011110110000010011101… |
… | …0110110011010010010011 |
3 | 1201002222122100012000010001 |
4 | 2331200213112303102103 |
5 | 3201332101242131011 |
6 | 43410403434350431 |
7 | 2512611052105666 |
oct | 275404726632223 |
9 | 51088570160101 |
10 | 13023001130131 |
11 | 41710296a1253 |
12 | 1563b4088b417 |
13 | 7360aa051aa5 |
14 | 330460b296dd |
15 | 178b58b1b7c1 |
hex | bd8275b3493 |
13023001130131 has 2 divisors, whose sum is σ = 13023001130132. Its totient is φ = 13023001130130.
The previous prime is 13023001130099. The next prime is 13023001130171. The reversal of 13023001130131 is 13103110032031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13023001130131 - 25 = 13023001130099 is a prime.
It is a super-2 number, since 2×130230011301312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13023001130099 and 13023001130108.
It is not a weakly prime, because it can be changed into another prime (13023001130171) 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, 6511500565065 + 6511500565066.
It is an arithmetic number, because the mean of its divisors is an integer number (6511500565066).
Almost surely, 213023001130131 is an apocalyptic number.
13023001130131 is a deficient number, since it is larger than the sum of its proper divisors (1).
13023001130131 is an equidigital number, since it uses as much as digits as its factorization.
13023001130131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13023001130131 its reverse (13103110032031), we get a palindrome (26126111162162).
The spelling of 13023001130131 in words is "thirteen trillion, twenty-three billion, one million, one hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •