Base | Representation |
---|---|
bin | 11110000101101101111101… |
… | …100001100101001011111001 |
3 | 122100120001001220210012000000 |
4 | 132011231331201211023321 |
5 | 114321131213341441441 |
6 | 1145241320312303213 |
7 | 36605561251365456 |
oct | 3605557541451371 |
9 | 570501056705000 |
10 | 132334343312121 |
11 | 39190752939a95 |
12 | 12a133479a1b09 |
13 | 58ac0c8ab5a02 |
14 | 2497032d9882d |
15 | 10474beceb2b6 |
hex | 785b7d8652f9 |
132334343312121 has 56 divisors (see below), whose sum is σ = 208526785736640. Its totient is φ = 83780014434336.
The previous prime is 132334343312107. The next prime is 132334343312159. The reversal of 132334343312121 is 121213343433231.
132334343312121 is a `hidden beast` number, since 1 + 3 + 2 + 3 + 3 + 4 + 3 + 433 + 1 + 212 + 1 = 666.
It is not a de Polignac number, because 132334343312121 - 26 = 132334343312057 is a prime.
It is not an unprimeable number, because it can be changed into a prime (132334343352121) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 26059846 + ... + 30721071.
It is an arithmetic number, because the mean of its divisors is an integer number (3723692602440).
Almost surely, 2132334343312121 is an apocalyptic number.
It is an amenable number.
132334343312121 is a deficient number, since it is larger than the sum of its proper divisors (76192442424519).
132334343312121 is an equidigital number, since it uses as much as digits as its factorization.
132334343312121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56781097 (or 56781082 counting only the distinct ones).
The product of its digits is 93312, while the sum is 36.
Adding to 132334343312121 its reverse (121213343433231), we get a palindrome (253547686745352).
The spelling of 132334343312121 in words is "one hundred thirty-two trillion, three hundred thirty-four billion, three hundred forty-three million, three hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •