Base | Representation |
---|---|
bin | 11110000011111110010100… |
… | …010011101011110110000101 |
3 | 122100010120122111100012002102 |
4 | 132003332110103223312011 |
5 | 114312200211403223221 |
6 | 1145110253135321445 |
7 | 36564115506101045 |
oct | 3603762423536605 |
9 | 570116574305072 |
10 | 132214466461061 |
11 | 39144927547556 |
12 | 129b4071380285 |
13 | 58a0a0328894a |
14 | 249130014b725 |
15 | 1044305a6e30b |
hex | 783f944ebd85 |
132214466461061 has 32 divisors (see below), whose sum is σ = 143350296860160. Its totient is φ = 121476902916096.
The previous prime is 132214466461019. The next prime is 132214466461081. The reversal of 132214466461061 is 160164664412231.
It is a cyclic number.
It is not a de Polignac number, because 132214466461061 - 226 = 132214399352197 is a prime.
It is a super-4 number, since 4×1322144664610614 (a number of 58 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132214466460997 and 132214466461015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132214466461081) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 147424160 + ... + 148318278.
It is an arithmetic number, because the mean of its divisors is an integer number (4479696776880).
Almost surely, 2132214466461061 is an apocalyptic number.
It is an amenable number.
132214466461061 is a deficient number, since it is larger than the sum of its proper divisors (11135830399099).
132214466461061 is a wasteful number, since it uses less digits than its factorization.
132214466461061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 895013.
The product of its (nonzero) digits is 995328, while the sum is 47.
The spelling of 132214466461061 in words is "one hundred thirty-two trillion, two hundred fourteen billion, four hundred sixty-six million, four hundred sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •