Base | Representation |
---|---|
bin | 1000111000101101101… |
… | …1101000100000000001 |
3 | 112121001100121122102001 |
4 | 2032023123220200001 |
5 | 10000123230212121 |
6 | 154044340424001 |
7 | 14013064132651 |
oct | 2161333504001 |
9 | 477040548361 |
10 | 152663132161 |
11 | 598203a3821 |
12 | 257066a8001 |
13 | 1151c227bc7 |
14 | 7563348361 |
15 | 3e877d0991 |
hex | 238b6e8801 |
152663132161 has 8 divisors (see below), whose sum is σ = 153248246784. Its totient is φ = 152078178240.
The previous prime is 152663132101. The next prime is 152663132197. The reversal of 152663132161 is 161231366251.
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 152663132161 - 213 = 152663123969 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 152663132161.
It is not an unprimeable number, because it can be changed into a prime (152663132101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2075760 + ... + 2148046.
It is an arithmetic number, because the mean of its divisors is an integer number (19156030848).
Almost surely, 2152663132161 is an apocalyptic number.
It is an amenable number.
152663132161 is a deficient number, since it is larger than the sum of its proper divisors (585114623).
152663132161 is an equidigital number, since it uses as much as digits as its factorization.
152663132161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80351.
The product of its digits is 38880, while the sum is 37.
The spelling of 152663132161 in words is "one hundred fifty-two billion, six hundred sixty-three million, one hundred thirty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •