Base | Representation |
---|---|
bin | 10000110111111… |
… | …11010111010001 |
3 | 100212100202011110 |
4 | 20123333113101 |
5 | 242214231103 |
6 | 22014003533 |
7 | 3336125145 |
oct | 1033772721 |
9 | 325322143 |
10 | 141555153 |
11 | 729a4533 |
12 | 3b4a65a9 |
13 | 2343315c |
14 | 14b2b225 |
15 | c662403 |
hex | 86ff5d1 |
141555153 has 8 divisors (see below), whose sum is σ = 188800416. Its totient is φ = 94340000.
The previous prime is 141555151. The next prime is 141555163. The reversal of 141555153 is 351555141.
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 141555153 - 21 = 141555151 is a prime.
It is a super-2 number, since 2×1415551532 = 40075722681706818, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 141555153.
It is not an unprimeable number, because it can be changed into a prime (141555151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8053 + ... + 18653.
It is an arithmetic number, because the mean of its divisors is an integer number (23600052).
Almost surely, 2141555153 is an apocalyptic number.
It is an amenable number.
141555153 is a deficient number, since it is larger than the sum of its proper divisors (47245263).
141555153 is a wasteful number, since it uses less digits than its factorization.
141555153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15055.
The product of its digits is 7500, while the sum is 30.
The square root of 141555153 is about 11897.6952810198. The cubic root of 141555153 is about 521.1649830001.
The spelling of 141555153 in words is "one hundred forty-one million, five hundred fifty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •