Base | Representation |
---|---|
bin | 111101001001111100… |
… | …0010111010111110111 |
3 | 110112222121122112221201 |
4 | 1322103320113113313 |
5 | 4122430442423211 |
6 | 140155430353331 |
7 | 12326323652554 |
oct | 1722370272767 |
9 | 415877575851 |
10 | 131330045431 |
11 | 50773428a32 |
12 | 215521bb847 |
13 | c4cc5cc370 |
14 | 64dbdaba2b |
15 | 36399db0c1 |
hex | 1e93e175f7 |
131330045431 has 4 divisors (see below), whose sum is σ = 141432356632. Its totient is φ = 121227734232.
The previous prime is 131330045381. The next prime is 131330045437. The reversal of 131330045431 is 134540033131.
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 131330045431 - 213 = 131330037239 is a prime.
It is a super-2 number, since 2×1313300454312 (a number of 23 digits) contains 22 as substring.
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 131330045431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131330045437) 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, 5051155581 + ... + 5051155606.
It is an arithmetic number, because the mean of its divisors is an integer number (35358089158).
Almost surely, 2131330045431 is an apocalyptic number.
131330045431 is a deficient number, since it is larger than the sum of its proper divisors (10102311201).
131330045431 is a wasteful number, since it uses less digits than its factorization.
131330045431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10102311200.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 131330045431 its reverse (134540033131), we get a palindrome (265870078562).
The spelling of 131330045431 in words is "one hundred thirty-one billion, three hundred thirty million, forty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •