Base | Representation |
---|---|
bin | 11110000010010101101010… |
… | …110000100000010001111101 |
3 | 122022201211121111102212110101 |
4 | 132002111222300200101331 |
5 | 114303330100124114401 |
6 | 1144542511141041101 |
7 | 36553030122611461 |
oct | 3602255260402175 |
9 | 568654544385411 |
10 | 132102100223101 |
11 | 39101205754888 |
12 | 129963320b6191 |
13 | 5893236794548 |
14 | 2489ac09b64a1 |
15 | 104142ad6e101 |
hex | 78256ac2047d |
132102100223101 has 8 divisors (see below), whose sum is σ = 132380158305024. Its totient is φ = 131824103370960.
The previous prime is 132102100223003. The next prime is 132102100223113. The reversal of 132102100223101 is 101322001201231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132102100223101 - 225 = 132102066668669 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 (132102100263101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10986661 + ... + 19619146.
It is an arithmetic number, because the mean of its divisors is an integer number (16547519788128).
Almost surely, 2132102100223101 is an apocalyptic number.
It is an amenable number.
132102100223101 is a deficient number, since it is larger than the sum of its proper divisors (278058081923).
132102100223101 is an equidigital number, since it uses as much as digits as its factorization.
132102100223101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30614891.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 132102100223101 its reverse (101322001201231), we get a palindrome (233424101424332).
The spelling of 132102100223101 in words is "one hundred thirty-two trillion, one hundred two billion, one hundred million, two hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •