Base | Representation |
---|---|
bin | 11110000001000000000001… |
… | …000010101110000011110101 |
3 | 122022102001020002120022101001 |
4 | 132001000001002232003311 |
5 | 114300323222332100041 |
6 | 1144432341221203301 |
7 | 36543263066302033 |
oct | 3601000102560365 |
9 | 568361202508331 |
10 | 132010132300021 |
11 | 39076201205a88 |
12 | 12980546260531 |
13 | 588766b049351 |
14 | 24854785ad553 |
15 | 103dd46d69131 |
hex | 7810010ae0f5 |
132010132300021 has 16 divisors (see below), whose sum is σ = 135155512654848. Its totient is φ = 128910471768000.
The previous prime is 132010132300001. The next prime is 132010132300103. The reversal of 132010132300021 is 120003231010231.
It is a cyclic number.
It is not a de Polignac number, because 132010132300021 - 225 = 132010098745589 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 (132010132300001) 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, 24030630 + ... + 29008471.
It is an arithmetic number, because the mean of its divisors is an integer number (8447219540928).
Almost surely, 2132010132300021 is an apocalyptic number.
It is an amenable number.
132010132300021 is a deficient number, since it is larger than the sum of its proper divisors (3145380354827).
132010132300021 is a wasteful number, since it uses less digits than its factorization.
132010132300021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53039532.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 132010132300021 its reverse (120003231010231), we get a palindrome (252013363310252).
The spelling of 132010132300021 in words is "one hundred thirty-two trillion, ten billion, one hundred thirty-two million, three hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •