Base | Representation |
---|---|
bin | 11110000011000011010100… |
… | …010011001011111010010101 |
3 | 122022220112010110110002212110 |
4 | 132003003110103023322111 |
5 | 114310130441041001040 |
6 | 1145021215005541233 |
7 | 36556413560252154 |
oct | 3603032423137225 |
9 | 568815113402773 |
10 | 132151115562645 |
11 | 3911aa78620963 |
12 | 129a3931274819 |
13 | 5897a4853813a |
14 | 248c21062d59b |
15 | 1042849062980 |
hex | 7830d44cbe95 |
132151115562645 has 32 divisors (see below), whose sum is σ = 215944929607680. Its totient is φ = 68979607611200.
The previous prime is 132151115562611. The next prime is 132151115562677. The reversal of 132151115562645 is 546265511151231.
It is not a de Polignac number, because 132151115562645 - 236 = 132082396085909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132151115562594 and 132151115562603.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33315370 + ... + 37070420.
It is an arithmetic number, because the mean of its divisors is an integer number (6748279050240).
Almost surely, 2132151115562645 is an apocalyptic number.
132151115562645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
132151115562645 is a deficient number, since it is larger than the sum of its proper divisors (83793814045035).
132151115562645 is a wasteful number, since it uses less digits than its factorization.
132151115562645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3805025.
The product of its digits is 1080000, while the sum is 48.
The spelling of 132151115562645 in words is "one hundred thirty-two trillion, one hundred fifty-one billion, one hundred fifteen million, five hundred sixty-two thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •