Base | Representation |
---|---|
bin | 11110000011000111001111… |
… | …000111010000001001110110 |
3 | 122022220220222201110021000120 |
4 | 132003013033013100021312 |
5 | 114310213100304444020 |
6 | 1145023152324552410 |
7 | 36556623054255261 |
oct | 3603071707201166 |
9 | 568826881407016 |
10 | 132155323515510 |
11 | 3912183792a159 |
12 | 129a4706552706 |
13 | 5898269269989 |
14 | 248c4cd435cd8 |
15 | 10429e36b3740 |
hex | 7831cf1d0276 |
132155323515510 has 32 divisors (see below), whose sum is σ = 317511274665312. Its totient is φ = 35203808689920.
The previous prime is 132155323515497. The next prime is 132155323515539. The reversal of 132155323515510 is 15515323551231.
It is a super-2 number, since 2×1321553235155102 (a number of 29 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 2350653561 + ... + 2350709780.
It is an arithmetic number, because the mean of its divisors is an integer number (9922227333291).
Almost surely, 2132155323515510 is an apocalyptic number.
132155323515510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132155323515510 is an abundant number, since it is smaller than the sum of its proper divisors (185355951149802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132155323515510 is a wasteful number, since it uses less digits than its factorization.
132155323515510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4701364288.
The product of its (nonzero) digits is 337500, while the sum is 42.
The spelling of 132155323515510 in words is "one hundred thirty-two trillion, one hundred fifty-five billion, three hundred twenty-three million, five hundred fifteen thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •