Base | Representation |
---|---|
bin | 11110000011000010111000… |
… | …101001001010001011001001 |
3 | 122022220110221010100100210100 |
4 | 132003002320221022023021 |
5 | 114310124013244420044 |
6 | 1145021100552440013 |
7 | 36556366224304521 |
oct | 3603027051121311 |
9 | 568813833310710 |
10 | 132150651560649 |
11 | 3911a85a711337 |
12 | 129a38219a9009 |
13 | 58979a3378147 |
14 | 248c1a8b68681 |
15 | 104281d45a869 |
hex | 7830b8a4a2c9 |
132150651560649 has 12 divisors (see below), whose sum is σ = 190884467185776. Its totient is φ = 88100345431032.
The previous prime is 132150651560647. The next prime is 132150651560663. The reversal of 132150651560649 is 946065156051231.
132150651560649 is a `hidden beast` number, since 1 + 3 + 2 + 1 + 5 + 0 + 6 + 515 + 60 + 64 + 9 = 666.
It is not a de Polignac number, because 132150651560649 - 21 = 132150651560647 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132150651560595 and 132150651560604.
It is not an unprimeable number, because it can be changed into a prime (132150651560647) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2728282 + ... + 16484684.
It is an arithmetic number, because the mean of its divisors is an integer number (15907038932148).
Almost surely, 2132150651560649 is an apocalyptic number.
It is an amenable number.
132150651560649 is a deficient number, since it is larger than the sum of its proper divisors (58733815625127).
132150651560649 is a wasteful number, since it uses less digits than its factorization.
132150651560649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14823796 (or 14823793 counting only the distinct ones).
The product of its (nonzero) digits is 5832000, while the sum is 54.
The spelling of 132150651560649 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred fifty-one million, five hundred sixty thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •