Base | Representation |
---|---|
bin | 11101111100001001011010… |
… | …110100110110010100111101 |
3 | 122021020011101211100020211112 |
4 | 131330021122310312110331 |
5 | 114224342220034223341 |
6 | 1144015224222331405 |
7 | 36510215446360463 |
oct | 3574113264662475 |
9 | 567204354306745 |
10 | 131676631164221 |
11 | 38a578225425a0 |
12 | 12927991429b65 |
13 | 586208c6ac080 |
14 | 247327c04a833 |
15 | 10353284ecaeb |
hex | 77c25ad3653d |
131676631164221 has 16 divisors (see below), whose sum is σ = 155877914541888. Its totient is φ = 109654377081600.
The previous prime is 131676631164139. The next prime is 131676631164263. The reversal of 131676631164221 is 122461136676131.
It is not a de Polignac number, because 131676631164221 - 226 = 131676564055357 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131676631164221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131676631164121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3514544636 + ... + 3514582101.
It is an arithmetic number, because the mean of its divisors is an integer number (9742369658868).
Almost surely, 2131676631164221 is an apocalyptic number.
131676631164221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131676631164221 is a deficient number, since it is larger than the sum of its proper divisors (24201283377667).
131676631164221 is a wasteful number, since it uses less digits than its factorization.
131676631164221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7029126892.
The product of its digits is 1306368, while the sum is 50.
The spelling of 131676631164221 in words is "one hundred thirty-one trillion, six hundred seventy-six billion, six hundred thirty-one million, one hundred sixty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •