Base | Representation |
---|---|
bin | 11110000001000000010011… |
… | …000010100000001010111101 |
3 | 122022102002000010201002120202 |
4 | 132001000103002200022331 |
5 | 114300324332130424041 |
6 | 1144432431204453245 |
7 | 36543303423552131 |
oct | 3601002302401275 |
9 | 568362003632522 |
10 | 132010434233021 |
11 | 3907634668a793 |
12 | 1298060b3aa225 |
13 | 58876b8772c26 |
14 | 24854a67273c1 |
15 | 103dd6360aa9b |
hex | 7810130a02bd |
132010434233021 has 16 divisors (see below), whose sum is σ = 140399944980480. Its totient is φ = 123933284492160.
The previous prime is 132010434233017. The next prime is 132010434233023. The reversal of 132010434233021 is 120332434010231.
It is a cyclic number.
It is not a de Polignac number, because 132010434233021 - 22 = 132010434233017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132010434233023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 451242485 + ... + 451534938.
It is an arithmetic number, because the mean of its divisors is an integer number (8774996561280).
Almost surely, 2132010434233021 is an apocalyptic number.
It is an amenable number.
132010434233021 is a deficient number, since it is larger than the sum of its proper divisors (8389510747459).
132010434233021 is an equidigital number, since it uses as much as digits as its factorization.
132010434233021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 902777596.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 132010434233021 its reverse (120332434010231), we get a palindrome (252342868243252).
The spelling of 132010434233021 in words is "one hundred thirty-two trillion, ten billion, four hundred thirty-four million, two hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •