Base | Representation |
---|---|
bin | 111101100000111011… |
… | …0000110100010011011 |
3 | 110121222100201110210202 |
4 | 1323001312012202123 |
5 | 4131020402012443 |
6 | 140404135132415 |
7 | 12354406464620 |
oct | 1730166064233 |
9 | 417870643722 |
10 | 132101204123 |
11 | 5102975a969 |
12 | 2172851410b |
13 | c5c32c4795 |
14 | 657258a347 |
15 | 36825677b8 |
hex | 1ec1d8689b |
132101204123 has 4 divisors (see below), whose sum is σ = 150972804720. Its totient is φ = 113229603528.
The previous prime is 132101204119. The next prime is 132101204129. The reversal of 132101204123 is 321402101231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132101204123 - 22 = 132101204119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132101204095 and 132101204104.
It is not an unprimeable number, because it can be changed into a prime (132101204129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9435800288 + ... + 9435800301.
It is an arithmetic number, because the mean of its divisors is an integer number (37743201180).
Almost surely, 2132101204123 is an apocalyptic number.
132101204123 is a deficient number, since it is larger than the sum of its proper divisors (18871600597).
132101204123 is an equidigital number, since it uses as much as digits as its factorization.
132101204123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18871600596.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 132101204123 its reverse (321402101231), we get a palindrome (453503305354).
The spelling of 132101204123 in words is "one hundred thirty-two billion, one hundred one million, two hundred four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •