Base | Representation |
---|---|
bin | 111101010011001110… |
… | …1001101000011010001 |
3 | 110120210100001212011220 |
4 | 1322212131031003101 |
5 | 4124100233123434 |
6 | 140250402155253 |
7 | 12340126631325 |
oct | 1724635150321 |
9 | 416710055156 |
10 | 131641692369 |
11 | 50913337990 |
12 | 2161a652b29 |
13 | c54c047535 |
14 | 652b533985 |
15 | 365704ad49 |
hex | 1ea674d0d1 |
131641692369 has 32 divisors (see below), whose sum is σ = 193853592576. Its totient is φ = 78799456320.
The previous prime is 131641692361. The next prime is 131641692383. The reversal of 131641692369 is 963296146131.
It is not a de Polignac number, because 131641692369 - 23 = 131641692361 is a prime.
It is a super-2 number, since 2×1316416923692 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (131641692361) 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, 789154 + ... + 941300.
It is an arithmetic number, because the mean of its divisors is an integer number (6057924768).
Almost surely, 2131641692369 is an apocalyptic number.
It is an amenable number.
131641692369 is a deficient number, since it is larger than the sum of its proper divisors (62211900207).
131641692369 is a wasteful number, since it uses less digits than its factorization.
131641692369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152485.
The product of its digits is 1259712, while the sum is 51.
The spelling of 131641692369 in words is "one hundred thirty-one billion, six hundred forty-one million, six hundred ninety-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •