Base | Representation |
---|---|
bin | 111101001110000110… |
… | …0111000001101100101 |
3 | 110120100100022201110021 |
4 | 1322130030320031211 |
5 | 4123222211444144 |
6 | 140221334355141 |
7 | 12332640335452 |
oct | 1723414701545 |
9 | 416310281407 |
10 | 131469640549 |
11 | 508352038a5 |
12 | 21590abbab1 |
13 | c5224c7320 |
14 | 6512748829 |
15 | 3646db2884 |
hex | 1e9c338365 |
131469640549 has 32 divisors (see below), whose sum is σ = 148990464000. Its totient is φ = 115154645760.
The previous prime is 131469640541. The next prime is 131469640583. The reversal of 131469640549 is 945046964131.
It is a cyclic number.
It is not a de Polignac number, because 131469640549 - 23 = 131469640541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131469640496 and 131469640505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131469640541) 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 31 ways as a sum of consecutive naturals, for example, 54800652 + ... + 54803050.
It is an arithmetic number, because the mean of its divisors is an integer number (4655952000).
Almost surely, 2131469640549 is an apocalyptic number.
It is an amenable number.
131469640549 is a deficient number, since it is larger than the sum of its proper divisors (17520823451).
131469640549 is a wasteful number, since it uses less digits than its factorization.
131469640549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4885.
The product of its (nonzero) digits is 2799360, while the sum is 52.
The spelling of 131469640549 in words is "one hundred thirty-one billion, four hundred sixty-nine million, six hundred forty thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •