Base | Representation |
---|---|
bin | 11110000011000101101100… |
… | …000101100100101100111101 |
3 | 122022220202200221021011221010 |
4 | 132003011230011210230331 |
5 | 114310201200001143010 |
6 | 1145022315415425433 |
7 | 36556533641603544 |
oct | 3603055405445475 |
9 | 568822627234833 |
10 | 132153662131005 |
11 | 39121065041409 |
12 | 129a4322085279 |
13 | 5898062cc0a18 |
14 | 248c3b292315b |
15 | 10429478db620 |
hex | 78316c164b3d |
132153662131005 has 8 divisors (see below), whose sum is σ = 211445859409632. Its totient is φ = 70481953136528.
The previous prime is 132153662130943. The next prime is 132153662131019. The reversal of 132153662131005 is 500131266351231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132153662131005 - 29 = 132153662130493 is a prime.
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 7 ways as a sum of consecutive naturals, for example, 4405122071019 + ... + 4405122071048.
It is an arithmetic number, because the mean of its divisors is an integer number (26430732426204).
Almost surely, 2132153662131005 is an apocalyptic number.
132153662131005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
132153662131005 is a deficient number, since it is larger than the sum of its proper divisors (79292197278627).
132153662131005 is an equidigital number, since it uses as much as digits as its factorization.
132153662131005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8810244142075.
The product of its (nonzero) digits is 97200, while the sum is 39.
The spelling of 132153662131005 in words is "one hundred thirty-two trillion, one hundred fifty-three billion, six hundred sixty-two million, one hundred thirty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •