Base | Representation |
---|---|
bin | 111101000000011001… |
… | …1111101010100001111 |
3 | 110112011022122210220122 |
4 | 1322000303331110033 |
5 | 4121302042414043 |
6 | 140104001335155 |
7 | 12315360446303 |
oct | 1720063752417 |
9 | 415138583818 |
10 | 131010123023 |
11 | 5061988754a |
12 | 214830374bb |
13 | c47b247570 |
14 | 64ab6cdd03 |
15 | 361b894368 |
hex | 1e80cfd50f |
131010123023 has 8 divisors (see below), whose sum is σ = 141102612000. Its totient is φ = 120919746528.
The previous prime is 131010123017. The next prime is 131010123053. The reversal of 131010123023 is 320321010131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131010123023 - 26 = 131010122959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131010122992 and 131010123010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131010123053) 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, 398123 + ... + 648476.
It is an arithmetic number, because the mean of its divisors is an integer number (17637826500).
Almost surely, 2131010123023 is an apocalyptic number.
131010123023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
131010123023 is a deficient number, since it is larger than the sum of its proper divisors (10092488977).
131010123023 is a wasteful number, since it uses less digits than its factorization.
131010123023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1056241.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 131010123023 its reverse (320321010131), we get a palindrome (451331133154).
The spelling of 131010123023 in words is "one hundred thirty-one billion, ten million, one hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •