Base | Representation |
---|---|
bin | 111101011110010001… |
… | …0100101100010001011 |
3 | 110121202011020201000101 |
4 | 1322330202211202023 |
5 | 4130330110431443 |
6 | 140351235350231 |
7 | 12352246126564 |
oct | 1727442454213 |
9 | 417664221011 |
10 | 132012202123 |
11 | 50a934a039a |
12 | 21702752377 |
13 | c5aaa31b89 |
14 | 656481d16b |
15 | 367983684d |
hex | 1ebc8a588b |
132012202123 has 8 divisors (see below), whose sum is σ = 137023542656. Its totient is φ = 127047916800.
The previous prime is 132012202099. The next prime is 132012202139. The reversal of 132012202123 is 321202210231.
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 132012202123 - 213 = 132012193931 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132012202123.
It is not an unprimeable number, because it can be changed into a prime (132012202183) 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 7 ways as a sum of consecutive naturals, for example, 11758086 + ... + 11769307.
It is an arithmetic number, because the mean of its divisors is an integer number (17127942832).
Almost surely, 2132012202123 is an apocalyptic number.
132012202123 is a deficient number, since it is larger than the sum of its proper divisors (5011340533).
132012202123 is a wasteful number, since it uses less digits than its factorization.
132012202123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23527605.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 132012202123 its reverse (321202210231), we get a palindrome (453214412354).
The spelling of 132012202123 in words is "one hundred thirty-two billion, twelve million, two hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •