Base | Representation |
---|---|
bin | 111101001101001101… |
… | …1110100100000101001 |
3 | 110120021021112222112110 |
4 | 1322122123310200221 |
5 | 4123142120044423 |
6 | 140214355232533 |
7 | 12332130410106 |
oct | 1723233644051 |
9 | 416237488473 |
10 | 131440003113 |
11 | 5081a500851 |
12 | 21582ba8749 |
13 | c51931b393 |
14 | 650c831aad |
15 | 36444ab193 |
hex | 1e9a6f4829 |
131440003113 has 8 divisors (see below), whose sum is σ = 185562357408. Its totient is φ = 82472158784.
The previous prime is 131440003111. The next prime is 131440003139. The reversal of 131440003113 is 311300044131.
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 131440003113 - 21 = 131440003111 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 131440003113.
It is not an unprimeable number, because it can be changed into a prime (131440003111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1288627431 + ... + 1288627532.
It is an arithmetic number, because the mean of its divisors is an integer number (23195294676).
Almost surely, 2131440003113 is an apocalyptic number.
It is an amenable number.
131440003113 is a deficient number, since it is larger than the sum of its proper divisors (54122354295).
131440003113 is a wasteful number, since it uses less digits than its factorization.
131440003113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2577254983.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 131440003113 its reverse (311300044131), we get a palindrome (442740047244).
The spelling of 131440003113 in words is "one hundred thirty-one billion, four hundred forty million, three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •