Base | Representation |
---|---|
bin | 11101110110111101010001… |
… | …111101110011001110110011 |
3 | 122012222001212121022201012012 |
4 | 131312331101331303032303 |
5 | 114203021330024332243 |
6 | 1143143324131553135 |
7 | 36442362011426432 |
oct | 3566752175631663 |
9 | 565861777281165 |
10 | 131320000230323 |
11 | 3892a554696493 |
12 | 1288a84245b7ab |
13 | 5837566108028 |
14 | 245dcc9a8d119 |
15 | 102ae04282d18 |
hex | 776f51f733b3 |
131320000230323 has 4 divisors (see below), whose sum is σ = 131320173659688. Its totient is φ = 131319826800960.
The previous prime is 131320000230271. The next prime is 131320000230437. The reversal of 131320000230323 is 323032000023131.
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 131320000230323 - 212 = 131320000226227 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131320000730323) 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 in 3 ways as a sum of consecutive naturals, for example, 85573886 + ... + 87094947.
It is an arithmetic number, because the mean of its divisors is an integer number (32830043414922).
Almost surely, 2131320000230323 is an apocalyptic number.
131320000230323 is a deficient number, since it is larger than the sum of its proper divisors (173429365).
131320000230323 is an equidigital number, since it uses as much as digits as its factorization.
131320000230323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173429364.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 131320000230323 its reverse (323032000023131), we get a palindrome (454352000253454).
The spelling of 131320000230323 in words is "one hundred thirty-one trillion, three hundred twenty billion, two hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •