Base | Representation |
---|---|
bin | 11101110010100101111000… |
… | …100100100010110001100111 |
3 | 122011220101112002100122121020 |
4 | 131302211320210202301213 |
5 | 114133112430023210043 |
6 | 1142353431314222223 |
7 | 36411611513350641 |
oct | 3562457044426147 |
9 | 564811462318536 |
10 | 131020000210023 |
11 | 388242a7485a11 |
12 | 12840678b84973 |
13 | 58151962a0112 |
14 | 244d58a943891 |
15 | 10231e6abce83 |
hex | 772978922c67 |
131020000210023 has 4 divisors (see below), whose sum is σ = 174693333613368. Its totient is φ = 87346666806680.
The previous prime is 131020000210019. The next prime is 131020000210051. The reversal of 131020000210023 is 320012000020131.
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 131020000210023 - 22 = 131020000210019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131020000209984 and 131020000210011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131020000210013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21836666701668 + ... + 21836666701673.
It is an arithmetic number, because the mean of its divisors is an integer number (43673333403342).
Almost surely, 2131020000210023 is an apocalyptic number.
131020000210023 is a deficient number, since it is larger than the sum of its proper divisors (43673333403345).
131020000210023 is an equidigital number, since it uses as much as digits as its factorization.
131020000210023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43673333403344.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 131020000210023 its reverse (320012000020131), we get a palindrome (451032000230154).
The spelling of 131020000210023 in words is "one hundred thirty-one trillion, twenty billion, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •