Base | Representation |
---|---|
bin | 100011101001110101010111… |
… | …101000111000011000000101 |
3 | 202120012112210210212012220021 |
4 | 203221311113220320120011 |
5 | 131023104032411003013 |
6 | 1313255514033335141 |
7 | 45012614355454204 |
oct | 4351652750703005 |
9 | 676175723765807 |
10 | 156806431344133 |
11 | 45a6626361644a |
12 | 157061787074b1 |
13 | 6965a2440843c |
14 | 2aa168678323b |
15 | 131dd660e7a8d |
hex | 8e9d57a38605 |
156806431344133 has 8 divisors (see below), whose sum is σ = 161874400418816. Its totient is φ = 151739068338000.
The previous prime is 156806431344097. The next prime is 156806431344139. The reversal of 156806431344133 is 331443134608651.
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 156806431344133 - 233 = 156797841409541 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 (156806431344139) by changing a digit.
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, 150991293 + ... + 152026258.
It is an arithmetic number, because the mean of its divisors is an integer number (20234300052352).
Almost surely, 2156806431344133 is an apocalyptic number.
It is an amenable number.
156806431344133 is a deficient number, since it is larger than the sum of its proper divisors (5067969074683).
156806431344133 is a wasteful number, since it uses less digits than its factorization.
156806431344133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303034275.
The product of its (nonzero) digits is 7464960, while the sum is 52.
The spelling of 156806431344133 in words is "one hundred fifty-six trillion, eight hundred six billion, four hundred thirty-one million, three hundred forty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •