Base | Representation |
---|---|
bin | 111101101010001010… |
… | …1011100011111110111 |
3 | 110122202222102120211222 |
4 | 1323110111130133313 |
5 | 4132134310113143 |
6 | 140455020020555 |
7 | 12365164263305 |
oct | 1732425343767 |
9 | 418688376758 |
10 | 132411410423 |
11 | 51178875506 |
12 | 217b439175b |
13 | c642656cc6 |
14 | 65a1859275 |
15 | 369e8e0768 |
hex | 1ed455c7f7 |
132411410423 has 4 divisors (see below), whose sum is σ = 132414979920. Its totient is φ = 132407840928.
The previous prime is 132411410377. The next prime is 132411410429. The reversal of 132411410423 is 324014114231.
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 132411410423 - 26 = 132411410359 is a prime.
It is a super-2 number, since 2×1324114104232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132411410392 and 132411410401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132411410429) 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, 1728515 + ... + 1803492.
It is an arithmetic number, because the mean of its divisors is an integer number (33103744980).
Almost surely, 2132411410423 is an apocalyptic number.
132411410423 is a deficient number, since it is larger than the sum of its proper divisors (3569497).
132411410423 is an equidigital number, since it uses as much as digits as its factorization.
132411410423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3569496.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 132411410423 its reverse (324014114231), we get a palindrome (456425524654).
The spelling of 132411410423 in words is "one hundred thirty-two billion, four hundred eleven million, four hundred ten thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •