Base | Representation |
---|---|
bin | 111101001001111100… |
… | …0010111010101001111 |
3 | 110112222121122112201111 |
4 | 1322103320113111033 |
5 | 4122430442422023 |
6 | 140155430352451 |
7 | 12326323652224 |
oct | 1722370272517 |
9 | 415877575644 |
10 | 131330045263 |
11 | 5077342889a |
12 | 215521bb727 |
13 | c4cc5cc271 |
14 | 64dbdab94b |
15 | 36399db00d |
hex | 1e93e1754f |
131330045263 has 4 divisors (see below), whose sum is σ = 135566498368. Its totient is φ = 127093592160.
The previous prime is 131330045261. The next prime is 131330045351. The reversal of 131330045263 is 362540033131.
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 131330045263 - 21 = 131330045261 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 4236453073 = 131330045263 / (1 + 3 + 1 + 3 + 3 + 0 + 0 + 4 + 5 + 2 + 6 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131330045261) 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, 2118226506 + ... + 2118226567.
It is an arithmetic number, because the mean of its divisors is an integer number (33891624592).
Almost surely, 2131330045263 is an apocalyptic number.
131330045263 is a deficient number, since it is larger than the sum of its proper divisors (4236453105).
131330045263 is an equidigital number, since it uses as much as digits as its factorization.
131330045263 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4236453104.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 131330045263 its reverse (362540033131), we get a palindrome (493870078394).
The spelling of 131330045263 in words is "one hundred thirty-one billion, three hundred thirty million, forty-five thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •