Base | Representation |
---|---|
bin | 1000111011100001001… |
… | …0010100100111011101 |
3 | 112122222210122022221221 |
4 | 2032320102110213131 |
5 | 10003143402304031 |
6 | 154251142053341 |
7 | 14040532434403 |
oct | 2167022244735 |
9 | 478883568857 |
10 | 153415666141 |
11 | 5a077164731 |
12 | 2589671a251 |
13 | 1160c0cbb9a |
14 | 75d5279473 |
15 | 3ecd8cda11 |
hex | 23b84949dd |
153415666141 has 8 divisors (see below), whose sum is σ = 153597880800. Its totient is φ = 153233514192.
The previous prime is 153415666121. The next prime is 153415666147. The reversal of 153415666141 is 141666514351.
It is a happy number.
153415666141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 153415666141 - 27 = 153415666013 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 (153415666147) 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 7 ways as a sum of consecutive naturals, for example, 6368866 + ... + 6392908.
It is an arithmetic number, because the mean of its divisors is an integer number (19199735100).
Almost surely, 2153415666141 is an apocalyptic number.
It is an amenable number.
153415666141 is a deficient number, since it is larger than the sum of its proper divisors (182214659).
153415666141 is a wasteful number, since it uses less digits than its factorization.
153415666141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31355.
The product of its digits is 259200, while the sum is 43.
The spelling of 153415666141 in words is "one hundred fifty-three billion, four hundred fifteen million, six hundred sixty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •