Base | Representation |
---|---|
bin | 11101111011111100001101… |
… | …000011011000101010101001 |
3 | 122021011210202220220002111001 |
4 | 131323330031003120222221 |
5 | 114224124140002401103 |
6 | 1144004520211435001 |
7 | 36506204015654635 |
oct | 3573741503305251 |
9 | 567153686802431 |
10 | 131662441450153 |
11 | 38a51800847379 |
12 | 129250912b5a61 |
13 | 586093a9a7963 |
14 | 24726d36abdc5 |
15 | 1034c978e301d |
hex | 77bf0d0d8aa9 |
131662441450153 has 8 divisors (see below), whose sum is σ = 139649998165920. Its totient is φ = 123780680187840.
The previous prime is 131662441450151. The next prime is 131662441450187. The reversal of 131662441450153 is 351054144266131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131662441450153 - 21 = 131662441450151 is a prime.
It is a super-2 number, since 2×1316624414501532 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131662441450151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26448860800 + ... + 26448865777.
It is an arithmetic number, because the mean of its divisors is an integer number (17456249770740).
Almost surely, 2131662441450153 is an apocalyptic number.
It is an amenable number.
131662441450153 is a deficient number, since it is larger than the sum of its proper divisors (7987556715767).
131662441450153 is a wasteful number, since it uses less digits than its factorization.
131662441450153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52897726727.
The product of its (nonzero) digits is 1036800, while the sum is 46.
The spelling of 131662441450153 in words is "one hundred thirty-one trillion, six hundred sixty-two billion, four hundred forty-one million, four hundred fifty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •