Base | Representation |
---|---|
bin | 11110000001010110100010… |
… | …111011110001011001001111 |
3 | 122022111100200000001120201201 |
4 | 132001112202323301121033 |
5 | 114301222243221133033 |
6 | 1144451421500450331 |
7 | 36545110420616434 |
oct | 3601264273613117 |
9 | 568440600046651 |
10 | 132034323224143 |
11 | 3908549537235a |
12 | 129851778499a7 |
13 | 5889a24a72932 |
14 | 24866d1307b8b |
15 | 103e7b09c047d |
hex | 7815a2ef164f |
132034323224143 has 4 divisors (see below), whose sum is σ = 132286778909608. Its totient is φ = 131781867538680.
The previous prime is 132034323224123. The next prime is 132034323224173. The reversal of 132034323224143 is 341422323430231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132034323224143 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 (132034323224113) 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, 126227841948 + ... + 126227842993.
It is an arithmetic number, because the mean of its divisors is an integer number (33071694727402).
Almost surely, 2132034323224143 is an apocalyptic number.
132034323224143 is a deficient number, since it is larger than the sum of its proper divisors (252455685465).
132034323224143 is an equidigital number, since it uses as much as digits as its factorization.
132034323224143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252455685464.
The product of its (nonzero) digits is 248832, while the sum is 37.
Adding to 132034323224143 its reverse (341422323430231), we get a palindrome (473456646654374).
The spelling of 132034323224143 in words is "one hundred thirty-two trillion, thirty-four billion, three hundred twenty-three million, two hundred twenty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •