Base | Representation |
---|---|
bin | 10000110111111… |
… | …11010111000101 |
3 | 100212100202011000 |
4 | 20123333113011 |
5 | 242214231031 |
6 | 22014003513 |
7 | 3336125130 |
oct | 1033772705 |
9 | 325322130 |
10 | 141555141 |
11 | 729a4522 |
12 | 3b4a6599 |
13 | 23433150 |
14 | 14b2b217 |
15 | c6623e6 |
hex | 86ff5c5 |
141555141 has 64 divisors (see below), whose sum is σ = 273369600. Its totient is φ = 70253568.
The previous prime is 141555137. The next prime is 141555151.
141555141 is a `hidden beast` number, since 141 + 5 + 5 + 514 + 1 = 666.
141555141 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 141555141 - 22 = 141555137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141555131) 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 63 ways as a sum of consecutive naturals, for example, 40075 + ... + 43463.
It is an arithmetic number, because the mean of its divisors is an integer number (4271400).
Almost surely, 2141555141 is an apocalyptic number.
It is an amenable number.
141555141 is a deficient number, since it is larger than the sum of its proper divisors (131814459).
141555141 is a wasteful number, since it uses less digits than its factorization.
141555141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3435 (or 3429 counting only the distinct ones).
The product of its digits is 2000, while the sum is 27.
The square root of 141555141 is about 11897.6947767204. The cubic root of 141555141 is about 521.1649682733.
The spelling of 141555141 in words is "one hundred forty-one million, five hundred fifty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •