Base | Representation |
---|---|
bin | 10010001000100… |
… | …00101110111101 |
3 | 101121020002112001 |
4 | 21010100232331 |
5 | 302420041221 |
6 | 23032142301 |
7 | 3524634253 |
oct | 1104205675 |
9 | 347202461 |
10 | 152112061 |
11 | 78955052 |
12 | 42b37991 |
13 | 2568b34a |
14 | 162b85d3 |
15 | d54a391 |
hex | 9110bbd |
152112061 has 4 divisors (see below), whose sum is σ = 152268732. Its totient is φ = 151955392.
The previous prime is 152112049. The next prime is 152112097. The reversal of 152112061 is 160211251.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 160211251 = 1373 ⋅116687.
It can be written as a sum of positive squares in 2 ways, for example, as 112232836 + 39879225 = 10594^2 + 6315^2 .
It is a cyclic number.
It is not a de Polignac number, because 152112061 - 27 = 152111933 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 (152112031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76870 + ... + 78823.
It is an arithmetic number, because the mean of its divisors is an integer number (38067183).
Almost surely, 2152112061 is an apocalyptic number.
It is an amenable number.
152112061 is a deficient number, since it is larger than the sum of its proper divisors (156671).
152112061 is an equidigital number, since it uses as much as digits as its factorization.
152112061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156670.
The product of its (nonzero) digits is 120, while the sum is 19.
The square root of 152112061 is about 12333.3718422822. The cubic root of 152112061 is about 533.8114482983.
The spelling of 152112061 in words is "one hundred fifty-two million, one hundred twelve thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •