Base | Representation |
---|---|
bin | 11101110110111101010001… |
… | …111111101101010011010011 |
3 | 122012222001212122021010001201 |
4 | 131312331101333231103103 |
5 | 114203021330141332243 |
6 | 1143143324150412031 |
7 | 36442362015611236 |
oct | 3566752177552323 |
9 | 565861778233051 |
10 | 131320000730323 |
11 | 3892a5549a8109 |
12 | 1288a842661017 |
13 | 58375662517a2 |
14 | 245dcc9b7d41d |
15 | 102ae0433104d |
hex | 776f51fed4d3 |
131320000730323 has 2 divisors, whose sum is σ = 131320000730324. Its totient is φ = 131320000730322.
The previous prime is 131320000730297. The next prime is 131320000730407. The reversal of 131320000730323 is 323037000023131.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131320000730323 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131320000730291 and 131320000730300.
It is not a weakly prime, because it can be changed into another prime (131320000730923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65660000365161 + 65660000365162.
It is an arithmetic number, because the mean of its divisors is an integer number (65660000365162).
Almost surely, 2131320000730323 is an apocalyptic number.
131320000730323 is a deficient number, since it is larger than the sum of its proper divisors (1).
131320000730323 is an equidigital number, since it uses as much as digits as its factorization.
131320000730323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 28.
Adding to 131320000730323 its reverse (323037000023131), we get a palindrome (454357000753454).
The spelling of 131320000730323 in words is "one hundred thirty-one trillion, three hundred twenty billion, seven hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •