Base | Representation |
---|---|
bin | 1000111010001001011… |
… | …0100011010011101101 |
3 | 112122001011012111120200 |
4 | 2032202112203103231 |
5 | 10001420201114031 |
6 | 154150434504113 |
7 | 14025443532303 |
oct | 2164226432355 |
9 | 478034174520 |
10 | 153047676141 |
11 | 599a8472368 |
12 | 257b3435039 |
13 | 11580ab7419 |
14 | 759c448273 |
15 | 3eab43e8e6 |
hex | 23a25a34ed |
153047676141 has 24 divisors (see below), whose sum is σ = 228342616320. Its totient is φ = 98678779200.
The previous prime is 153047676121. The next prime is 153047676149. The reversal of 153047676141 is 141676740351.
It is a happy number.
153047676141 is a `hidden beast` number, since 1 + 5 + 30 + 476 + 7 + 6 + 141 = 666.
153047676141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 153047676141 - 26 = 153047676077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153047676149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 278446 + ... + 619376.
It is an arithmetic number, because the mean of its divisors is an integer number (9514275680).
Almost surely, 2153047676141 is an apocalyptic number.
It is an amenable number.
153047676141 is a deficient number, since it is larger than the sum of its proper divisors (75294940179).
153047676141 is a wasteful number, since it uses less digits than its factorization.
153047676141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 342577 (or 342574 counting only the distinct ones).
The product of its (nonzero) digits is 423360, while the sum is 45.
The spelling of 153047676141 in words is "one hundred fifty-three billion, forty-seven million, six hundred seventy-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •