Base | Representation |
---|---|
bin | 111101000000110100… |
… | …0111011110011000001 |
3 | 110112012021210100212011 |
4 | 1322001220323303001 |
5 | 4121314121313213 |
6 | 140105215132521 |
7 | 12315616466341 |
oct | 1720150736301 |
9 | 415167710764 |
10 | 131024010433 |
11 | 50626702348 |
12 | 21487814141 |
13 | c48109a674 |
14 | 64ad4a6d21 |
15 | 361cbd903d |
hex | 1e81a3bcc1 |
131024010433 has 4 divisors (see below), whose sum is σ = 131026655620. Its totient is φ = 131021365248.
The previous prime is 131024010379. The next prime is 131024010437. The reversal of 131024010433 is 334010420131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 334010420131 = 39233 ⋅8513507.
It can be written as a sum of positive squares in 2 ways, for example, as 80438602689 + 50585407744 = 283617^2 + 224912^2 .
It is a cyclic number.
It is not a de Polignac number, because 131024010433 - 229 = 130487139521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131024010437) 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, 1246848 + ... + 1347841.
It is an arithmetic number, because the mean of its divisors is an integer number (32756663905).
Almost surely, 2131024010433 is an apocalyptic number.
It is an amenable number.
131024010433 is a deficient number, since it is larger than the sum of its proper divisors (2645187).
131024010433 is an equidigital number, since it uses as much as digits as its factorization.
131024010433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2645186.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 131024010433 its reverse (334010420131), we get a palindrome (465034430564).
The spelling of 131024010433 in words is "one hundred thirty-one billion, twenty-four million, ten thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •