Base | Representation |
---|---|
bin | 10010000101100… |
… | …01000011001101 |
3 | 101120111011220111 |
4 | 21002301003031 |
5 | 302320021031 |
6 | 23015520021 |
7 | 3521412526 |
oct | 1102610315 |
9 | 346434814 |
10 | 151720141 |
11 | 78707651 |
12 | 42989011 |
13 | 25581b41 |
14 | 1621584d |
15 | d4be1b1 |
hex | 90b10cd |
151720141 has 8 divisors (see below), whose sum is σ = 157754520. Its totient is φ = 145739328.
The previous prime is 151720109. The next prime is 151720157. The reversal of 151720141 is 141027151.
It can be written as a sum of positive squares in 4 ways, for example, as 63266116 + 88454025 = 7954^2 + 9405^2 .
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 151720141 - 25 = 151720109 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 (151720181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7566 + ... + 18991.
It is an arithmetic number, because the mean of its divisors is an integer number (19719315).
Almost surely, 2151720141 is an apocalyptic number.
It is an amenable number.
151720141 is a deficient number, since it is larger than the sum of its proper divisors (6034379).
151720141 is a wasteful number, since it uses less digits than its factorization.
151720141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26783.
The product of its (nonzero) digits is 280, while the sum is 22.
The square root of 151720141 is about 12317.4729957082. The cubic root of 151720141 is about 533.3525950943.
Adding to 151720141 its reverse (141027151), we get a palindrome (292747292).
The spelling of 151720141 in words is "one hundred fifty-one million, seven hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •