Base | Representation |
---|---|
bin | 11110000011111110010100… |
… | …010011100010011101010101 |
3 | 122100010120122111021020100102 |
4 | 132003332110103202131111 |
5 | 114312200211401010423 |
6 | 1145110253134423445 |
7 | 36564115505551001 |
oct | 3603762423423525 |
9 | 570116574236312 |
10 | 132214466422613 |
11 | 39144927520683 |
12 | 129b4071361b85 |
13 | 58a0a032742b3 |
14 | 249130013b701 |
15 | 1044305a62c28 |
hex | 783f944e2755 |
132214466422613 has 4 divisors (see below), whose sum is σ = 132215225826048. Its totient is φ = 132213707019180.
The previous prime is 132214466422609. The next prime is 132214466422657. The reversal of 132214466422613 is 316224664412231.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 132214466422613 - 22 = 132214466422609 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132214466422663) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 379440503 + ... + 379788788.
It is an arithmetic number, because the mean of its divisors is an integer number (33053806456512).
Almost surely, 2132214466422613 is an apocalyptic number.
It is an amenable number.
132214466422613 is a deficient number, since it is larger than the sum of its proper divisors (759403435).
132214466422613 is an equidigital number, since it uses as much as digits as its factorization.
132214466422613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 759403434.
The product of its digits is 1990656, while the sum is 47.
The spelling of 132214466422613 in words is "one hundred thirty-two trillion, two hundred fourteen billion, four hundred sixty-six million, four hundred twenty-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •