Base | Representation |
---|---|
bin | 11110000011000010101111… |
… | …111111110110111101000100 |
3 | 122022220110120000102100100010 |
4 | 132003002233333312331010 |
5 | 114310123214132010132 |
6 | 1145021034331550220 |
7 | 36556362513404625 |
oct | 3603025777667504 |
9 | 568813500370303 |
10 | 132150506516292 |
11 | 3911a795854370 |
12 | 129a37a12bb370 |
13 | 589797c2c2a94 |
14 | 248c1937ada4c |
15 | 10428108596cc |
hex | 7830afff6f44 |
132150506516292 has 96 divisors (see below), whose sum is σ = 336875599226880. Its totient is φ = 39986986273920.
The previous prime is 132150506516291. The next prime is 132150506516387. The reversal of 132150506516292 is 292615605051231.
It is a super-2 number, since 2×1321505065162922 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (132150506516291) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1543825638 + ... + 1543911234.
It is an arithmetic number, because the mean of its divisors is an integer number (3509120825280).
Almost surely, 2132150506516292 is an apocalyptic number.
132150506516292 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
132150506516292 is an abundant number, since it is smaller than the sum of its proper divisors (204725092710588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132150506516292 is a wasteful number, since it uses less digits than its factorization.
132150506516292 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102601 (or 102599 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 48.
The spelling of 132150506516292 in words is "one hundred thirty-two trillion, one hundred fifty billion, five hundred six million, five hundred sixteen thousand, two hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •