Base | Representation |
---|---|
bin | 11110000110111110101101… |
… | …001100011100000011111101 |
3 | 122100212022212010110022011011 |
4 | 132012332231030130003331 |
5 | 114324041243330001023 |
6 | 1145345215335155221 |
7 | 36615050606561632 |
oct | 3606765514340375 |
9 | 570768763408134 |
10 | 132421042422013 |
11 | 392144a3268524 |
12 | 12a28103215b11 |
13 | 58b7334aa3777 |
14 | 249b2d9728189 |
15 | 104989649b50d |
hex | 786fad31c0fd |
132421042422013 has 16 divisors (see below), whose sum is σ = 140017239774720. Its totient is φ = 124887524806656.
The previous prime is 132421042421939. The next prime is 132421042422017. The reversal of 132421042422013 is 310224240124231.
It is a cyclic number.
It is not a de Polignac number, because 132421042422013 - 221 = 132421040324861 is a prime.
It is a super-2 number, since 2×1324210424220132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132421042422017) 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, 652807581 + ... + 653010397.
It is an arithmetic number, because the mean of its divisors is an integer number (8751077485920).
Almost surely, 2132421042422013 is an apocalyptic number.
It is an amenable number.
132421042422013 is a deficient number, since it is larger than the sum of its proper divisors (7596197352707).
132421042422013 is a wasteful number, since it uses less digits than its factorization.
132421042422013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357156.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 132421042422013 its reverse (310224240124231), we get a palindrome (442645282546244).
The spelling of 132421042422013 in words is "one hundred thirty-two trillion, four hundred twenty-one billion, forty-two million, four hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •