Base | Representation |
---|---|
bin | 11110000011010010001101… |
… | …101101000110111001001011 |
3 | 122022222001102012202210012010 |
4 | 132003102031231012321023 |
5 | 114310411220411412213 |
6 | 1145032422124351003 |
7 | 36560521135514451 |
oct | 3603221555067113 |
9 | 568861365683163 |
10 | 132167111044683 |
11 | 39126836660300 |
12 | 129a6a560a5463 |
13 | 58993c739bb00 |
14 | 248cccab469d1 |
15 | 1042e83464ac3 |
hex | 78348db46e4b |
132167111044683 has 72 divisors (see below), whose sum is σ = 210661508310960. Its totient is φ = 73616754182400.
The previous prime is 132167111044643. The next prime is 132167111044751. The reversal of 132167111044683 is 386440111761231.
132167111044683 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 132167111044683 - 241 = 129968087789131 is a prime.
It is a super-4 number, since 4×1321671110446834 (a number of 58 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (132167111044613) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 9344493 + ... + 18752433.
Almost surely, 2132167111044683 is an apocalyptic number.
132167111044683 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132167111044683 is a deficient number, since it is larger than the sum of its proper divisors (78494397266277).
132167111044683 is a wasteful number, since it uses less digits than its factorization.
132167111044683 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9408221 (or 9408197 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 48.
The spelling of 132167111044683 in words is "one hundred thirty-two trillion, one hundred sixty-seven billion, one hundred eleven million, forty-four thousand, six hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •