Base | Representation |
---|---|
bin | 111101001001010110… |
… | …0010010011000000111 |
3 | 110112221020010022201222 |
4 | 1322102230102120013 |
5 | 4122410341231043 |
6 | 140153435110555 |
7 | 12325662310532 |
oct | 1722254223007 |
9 | 415836108658 |
10 | 131310102023 |
11 | 50763147181 |
12 | 215475a245b |
13 | c4c8438929 |
14 | 64d9499a19 |
15 | 3637d9bd68 |
hex | 1e92b12607 |
131310102023 has 8 divisors (see below), whose sum is σ = 133561604592. Its totient is φ = 129067177536.
The previous prime is 131310101983. The next prime is 131310102043. The reversal of 131310102023 is 320201013131.
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 131310102023 - 26 = 131310101959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131310101992 and 131310102010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131310102043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2113640 + ... + 2174877.
It is an arithmetic number, because the mean of its divisors is an integer number (16695200574).
Almost surely, 2131310102023 is an apocalyptic number.
131310102023 is a deficient number, since it is larger than the sum of its proper divisors (2251502569).
131310102023 is an equidigital number, since it uses as much as digits as its factorization.
131310102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4289041.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 131310102023 its reverse (320201013131), we get a palindrome (451511115154).
The spelling of 131310102023 in words is "one hundred thirty-one billion, three hundred ten million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •