Base | Representation |
---|---|
bin | 11101110010010110010000… |
… | …100101101111111011000111 |
3 | 122011211210012212122211100120 |
4 | 131302112100211233323013 |
5 | 114132324100131410043 |
6 | 1142342014443113023 |
7 | 36410445666144021 |
oct | 3562262045577307 |
9 | 564753185584316 |
10 | 131003223310023 |
11 | 388181783476a9 |
12 | 12839376512773 |
13 | 581372159145c |
14 | 244c83873b011 |
15 | 1022a63cb4983 |
hex | 77259096fec7 |
131003223310023 has 8 divisors (see below), whose sum is σ = 174688606202736. Its totient is φ = 87326661312000.
The previous prime is 131003223310009. The next prime is 131003223310097. The reversal of 131003223310023 is 320013322300131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131003223310023 - 240 = 129903711682247 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131003223309975 and 131003223310002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131003223310423) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2205189018 + ... + 2205248423.
It is an arithmetic number, because the mean of its divisors is an integer number (21836075775342).
Almost surely, 2131003223310023 is an apocalyptic number.
131003223310023 is a deficient number, since it is larger than the sum of its proper divisors (43685382892713).
131003223310023 is an equidigital number, since it uses as much as digits as its factorization.
131003223310023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4410447345.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 131003223310023 its reverse (320013322300131), we get a palindrome (451016545610154).
The spelling of 131003223310023 in words is "one hundred thirty-one trillion, three billion, two hundred twenty-three million, three hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •