Base | Representation |
---|---|
bin | 11110000010111110110001… |
… | …101110110110100100101111 |
3 | 122022220001112201102122121202 |
4 | 132002332301232312210233 |
5 | 114310041000101123143 |
6 | 1145015051143320115 |
7 | 36556152014165414 |
oct | 3602766156664457 |
9 | 568801481378552 |
10 | 132146240645423 |
11 | 391189a6887454 |
12 | 129a29b075003b |
13 | 589744c592b34 |
14 | 248bcab00c10b |
15 | 10426610b7ab8 |
hex | 782fb1bb692f |
132146240645423 has 8 divisors (see below), whose sum is σ = 132519575546400. Its totient is φ = 131773419628128.
The previous prime is 132146240645417. The next prime is 132146240645467. The reversal of 132146240645423 is 324546042641231.
It is a happy number.
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 132146240645423 - 24 = 132146240645407 is a prime.
It is a super-2 number, since 2×1321462406454232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132146240645483) 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, 127955888 + ... + 128984501.
It is an arithmetic number, because the mean of its divisors is an integer number (16564946943300).
Almost surely, 2132146240645423 is an apocalyptic number.
132146240645423 is a deficient number, since it is larger than the sum of its proper divisors (373334900977).
132146240645423 is an equidigital number, since it uses as much as digits as its factorization.
132146240645423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256941841.
The product of its (nonzero) digits is 3317760, while the sum is 47.
The spelling of 132146240645423 in words is "one hundred thirty-two trillion, one hundred forty-six billion, two hundred forty million, six hundred forty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •