Base | Representation |
---|---|
bin | 1111100111100… |
… | …11011010110101 |
3 | 100010112112021222 |
4 | 13303303122311 |
5 | 232020123334 |
6 | 21000120125 |
7 | 3150440606 |
oct | 763633265 |
9 | 303475258 |
10 | 131020469 |
11 | 67a59688 |
12 | 37a66045 |
13 | 211b5108 |
14 | 13587dad |
15 | b780d2e |
hex | 7cf36b5 |
131020469 has 2 divisors, whose sum is σ = 131020470. Its totient is φ = 131020468.
The previous prime is 131020451. The next prime is 131020493. The reversal of 131020469 is 964020131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119028100 + 11992369 = 10910^2 + 3463^2 .
It is a cyclic number.
It is not a de Polignac number, because 131020469 - 212 = 131016373 is a prime.
It is a super-2 number, since 2×1310204692 = 34332726593959922, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131020069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65510234 + 65510235.
It is an arithmetic number, because the mean of its divisors is an integer number (65510235).
Almost surely, 2131020469 is an apocalyptic number.
It is an amenable number.
131020469 is a deficient number, since it is larger than the sum of its proper divisors (1).
131020469 is an equidigital number, since it uses as much as digits as its factorization.
131020469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 131020469 is about 11446.4172997493. The cubic root of 131020469 is about 507.9017585977.
The spelling of 131020469 in words is "one hundred thirty-one million, twenty thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •