Base | Representation |
---|---|
bin | 11110000011000111111110… |
… | …101010111101101010111110 |
3 | 122022221000001022211022012110 |
4 | 132003013332222331222332 |
5 | 114310221214034444032 |
6 | 1145023403430314450 |
7 | 36556651613235111 |
oct | 3603077652755276 |
9 | 568830038738173 |
10 | 132156121406142 |
11 | 3912210725a1a9 |
12 | 129a48a97b8a26 |
13 | 5898365661702 |
14 | 248c5673b2578 |
15 | 1042a3d7707cc |
hex | 7831feabdabe |
132156121406142 has 8 divisors (see below), whose sum is σ = 264312242812296. Its totient is φ = 44052040468712.
The previous prime is 132156121406137. The next prime is 132156121406201. The reversal of 132156121406142 is 241604121651231.
It is a sphenic number, since it is the product of 3 distinct primes.
132156121406142 is an admirable number.
It is a super-2 number, since 2×1321561214061422 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132156121406142.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11013010117173 + ... + 11013010117184.
It is an arithmetic number, because the mean of its divisors is an integer number (33039030351537).
Almost surely, 2132156121406142 is an apocalyptic number.
132156121406142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132156121406142 is a wasteful number, since it uses less digits than its factorization.
132156121406142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22026020234362.
The product of its (nonzero) digits is 69120, while the sum is 39.
The spelling of 132156121406142 in words is "one hundred thirty-two trillion, one hundred fifty-six billion, one hundred twenty-one million, four hundred six thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •