Base | Representation |
---|---|
bin | 11110000100100011010001… |
… | …101010110000000001110001 |
3 | 122100021101002011002111200201 |
4 | 132010203101222300001301 |
5 | 114313323000024421340 |
6 | 1145140415032515201 |
7 | 36600022066650142 |
oct | 3604432152600161 |
9 | 570241064074621 |
10 | 132254150623345 |
11 | 3915a741193a93 |
12 | 129bb8a754bb01 |
13 | 58a4688a8668a |
14 | 24931c67c1ac9 |
15 | 104537996979a |
hex | 7848d1ab0071 |
132254150623345 has 8 divisors (see below), whose sum is σ = 159416662277376. Its totient is φ = 105328866145776.
The previous prime is 132254150623337. The next prime is 132254150623367. The reversal of 132254150623345 is 543326051452231.
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 132254150623345 - 23 = 132254150623337 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132254150623295 and 132254150623304.
It is an unprimeable number.
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, 59306792887 + ... + 59306795116.
It is an arithmetic number, because the mean of its divisors is an integer number (19927082784672).
Almost surely, 2132254150623345 is an apocalyptic number.
It is an amenable number.
132254150623345 is a deficient number, since it is larger than the sum of its proper divisors (27162511654031).
132254150623345 is a wasteful number, since it uses less digits than its factorization.
132254150623345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118613588231.
The product of its (nonzero) digits is 2592000, while the sum is 46.
The spelling of 132254150623345 in words is "one hundred thirty-two trillion, two hundred fifty-four billion, one hundred fifty million, six hundred twenty-three thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •