Base | Representation |
---|---|
bin | 11110000011000010111001… |
… | …001110101111101010101111 |
3 | 122022220110221210212221102122 |
4 | 132003002321032233222233 |
5 | 114310124023310213201 |
6 | 1145021101543543155 |
7 | 36556366404122264 |
oct | 3603027116575257 |
9 | 568813853787378 |
10 | 132150661413551 |
11 | 3911a865230a30 |
12 | 129a382515aabb |
13 | 58979a5417a71 |
14 | 248c1aa1b126b |
15 | 104281e254e1b |
hex | 7830b93afaaf |
132150661413551 has 4 divisors (see below), whose sum is σ = 144164357905704. Its totient is φ = 120136964921400.
The previous prime is 132150661413469. The next prime is 132150661413553. The reversal of 132150661413551 is 155314166051231.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132150661413551 - 230 = 132149587671727 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 (132150661413553) 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, 6006848246060 + ... + 6006848246081.
It is an arithmetic number, because the mean of its divisors is an integer number (36041089476426).
Almost surely, 2132150661413551 is an apocalyptic number.
132150661413551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
132150661413551 is a deficient number, since it is larger than the sum of its proper divisors (12013696492153).
132150661413551 is a wasteful number, since it uses less digits than its factorization.
132150661413551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12013696492152.
The product of its (nonzero) digits is 324000, while the sum is 44.
The spelling of 132150661413551 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred sixty-one million, four hundred thirteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •