Base | Representation |
---|---|
bin | 111101001001111011… |
… | …0110101110000100101 |
3 | 110112222120220020111100 |
4 | 1322103312311300211 |
5 | 4122430342124410 |
6 | 140155414030313 |
7 | 12326320366104 |
oct | 1722366656045 |
9 | 415876806440 |
10 | 131329645605 |
11 | 507731855a4 |
12 | 21552048399 |
13 | c4cc4bc392 |
14 | 64dbd0603b |
15 | 363995c8c0 |
hex | 1e93db5c25 |
131329645605 has 24 divisors (see below), whose sum is σ = 228817539288. Its totient is φ = 69679558656.
The previous prime is 131329645591. The next prime is 131329645627. The reversal of 131329645605 is 506546923131.
131329645605 is a `hidden beast` number, since 1 + 3 + 1 + 3 + 29 + 64 + 560 + 5 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 182817441 + 131146828164 = 13521^2 + 362142^2 .
It is not a de Polignac number, because 131329645605 - 29 = 131329645093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7552032 + ... + 7569401.
It is an arithmetic number, because the mean of its divisors is an integer number (9534064137).
Almost surely, 2131329645605 is an apocalyptic number.
131329645605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
131329645605 is a deficient number, since it is larger than the sum of its proper divisors (97487893683).
131329645605 is a wasteful number, since it uses less digits than its factorization.
131329645605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15121637 (or 15121634 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 45.
The spelling of 131329645605 in words is "one hundred thirty-one billion, three hundred twenty-nine million, six hundred forty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •