Base | Representation |
---|---|
bin | 111101001101111111… |
… | …1000100011110000101 |
3 | 110120100002111211000022 |
4 | 1322123333010132011 |
5 | 4123220300130431 |
6 | 140221125024525 |
7 | 12332564511206 |
oct | 1723377043605 |
9 | 416302454008 |
10 | 131466020741 |
11 | 50833161220 |
12 | 2158b855145 |
13 | c52182a823 |
14 | 65120855ad |
15 | 36468ea07b |
hex | 1e9bfc4785 |
131466020741 has 4 divisors (see below), whose sum is σ = 143417477184. Its totient is φ = 119514564300.
The previous prime is 131466020737. The next prime is 131466020743. The reversal of 131466020741 is 147020664131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131466020741 - 22 = 131466020737 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131466020743) 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, 5975728205 + ... + 5975728226.
It is an arithmetic number, because the mean of its divisors is an integer number (35854369296).
Almost surely, 2131466020741 is an apocalyptic number.
131466020741 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131466020741 is a deficient number, since it is larger than the sum of its proper divisors (11951456443).
131466020741 is a wasteful number, since it uses less digits than its factorization.
131466020741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11951456442.
The product of its (nonzero) digits is 24192, while the sum is 35.
Adding to 131466020741 its reverse (147020664131), we get a palindrome (278486684872).
The spelling of 131466020741 in words is "one hundred thirty-one billion, four hundred sixty-six million, twenty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •