Base | Representation |
---|---|
bin | 111101000011001001… |
… | …1000001110100100111 |
3 | 110112101201211110201012 |
4 | 1322012103001310213 |
5 | 4121444122412043 |
6 | 140121050052435 |
7 | 12320555631251 |
oct | 1720623016447 |
9 | 415351743635 |
10 | 131102154023 |
11 | 50666825825 |
12 | 214a9a1a11b |
13 | c49432aa89 |
14 | 64b9a08cd1 |
15 | 36249c2a18 |
hex | 1e864c1d27 |
131102154023 has 4 divisors (see below), whose sum is σ = 132761675040. Its totient is φ = 129442633008.
The previous prime is 131102154017. The next prime is 131102154031. The reversal of 131102154023 is 320451201131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320451201131 = 459421 ⋅697511.
It is a cyclic number.
It is not a de Polignac number, because 131102154023 - 210 = 131102152999 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131102154023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131102154823) 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, 829760390 + ... + 829760547.
It is an arithmetic number, because the mean of its divisors is an integer number (33190418760).
Almost surely, 2131102154023 is an apocalyptic number.
131102154023 is a deficient number, since it is larger than the sum of its proper divisors (1659521017).
131102154023 is an equidigital number, since it uses as much as digits as its factorization.
131102154023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1659521016.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 131102154023 its reverse (320451201131), we get a palindrome (451553355154).
The spelling of 131102154023 in words is "one hundred thirty-one billion, one hundred two million, one hundred fifty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.475 sec. • engine limits •