Base | Representation |
---|---|
bin | 111101100001001111… |
… | …1011010001000101101 |
3 | 110122000010002121021101 |
4 | 1323002133122020231 |
5 | 4131031140013201 |
6 | 140405203203101 |
7 | 12354600513634 |
oct | 1730237321055 |
9 | 418003077241 |
10 | 132112032301 |
11 | 51034886277 |
12 | 21730076491 |
13 | c5c56162a2 |
14 | 6573ba851b |
15 | 36834a5d01 |
hex | 1ec27da22d |
132112032301 has 4 divisors (see below), whose sum is σ = 132112782972. Its totient is φ = 132111281632.
The previous prime is 132112032293. The next prime is 132112032389. The reversal of 132112032301 is 103230211231.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 66806740900 + 65305291401 = 258470^2 + 255549^2 .
It is a cyclic number.
It is not a de Polignac number, because 132112032301 - 23 = 132112032293 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 (132112038301) 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, 47241 + ... + 516193.
It is an arithmetic number, because the mean of its divisors is an integer number (33028195743).
Almost surely, 2132112032301 is an apocalyptic number.
It is an amenable number.
132112032301 is a deficient number, since it is larger than the sum of its proper divisors (750671).
132112032301 is an equidigital number, since it uses as much as digits as its factorization.
132112032301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 750670.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 132112032301 its reverse (103230211231), we get a palindrome (235342243532).
The spelling of 132112032301 in words is "one hundred thirty-two billion, one hundred twelve million, thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •