Base | Representation |
---|---|
bin | 111101010100100000… |
… | …1101000110000010000 |
3 | 110120220100011211020121 |
4 | 1322221001220300100 |
5 | 4124142302004311 |
6 | 140254542120024 |
7 | 12341162211202 |
oct | 1725101506020 |
9 | 416810154217 |
10 | 131684797456 |
11 | 509356a9423 |
12 | 21630b80014 |
13 | c557c5a4c4 |
14 | 6533154772 |
15 | 365ac12b71 |
hex | 1ea9068c10 |
131684797456 has 45 divisors (see below), whose sum is σ = 256863570871. Its totient is φ = 65400406016.
The previous prime is 131684797451. The next prime is 131684797457. The reversal of 131684797456 is 654797486131.
It is a happy number.
The square root of 131684797456 is 362884.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 37901859856 + 93782937600 = 194684^2 + 306240^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131684797394 and 131684797403.
It is not an unprimeable number, because it can be changed into a prime (131684797451) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 373044576 + ... + 373044928.
Almost surely, 2131684797456 is an apocalyptic number.
131684797456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
131684797456 is the 362884-th square number.
It is an amenable number.
131684797456 is a deficient number, since it is larger than the sum of its proper divisors (125178773415).
131684797456 is an frugal number, since it uses more digits than its factorization.
131684797456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1228 (or 612 counting only the distinct ones).
The product of its digits is 30481920, while the sum is 61.
The spelling of 131684797456 in words is "one hundred thirty-one billion, six hundred eighty-four million, seven hundred ninety-seven thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •