Base | Representation |
---|---|
bin | 10010001100110… |
… | …01001101001011 |
3 | 101122021111022101 |
4 | 21012121031023 |
5 | 303040433201 |
6 | 23052134231 |
7 | 3532453051 |
oct | 1106311513 |
9 | 348244271 |
10 | 152671051 |
11 | 791a7025 |
12 | 43167377 |
13 | 25825900 |
14 | 163c21d1 |
15 | d60ad01 |
hex | 919934b |
152671051 has 12 divisors (see below), whose sum is σ = 171024480. Its totient is φ = 136063200.
The previous prime is 152671031. The next prime is 152671073. The reversal of 152671051 is 150176251.
It is not a de Polignac number, because 152671051 - 27 = 152670923 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (152671021) 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 11 ways as a sum of consecutive naturals, for example, 10675 + ... + 20476.
It is an arithmetic number, because the mean of its divisors is an integer number (14252040).
Almost surely, 2152671051 is an apocalyptic number.
152671051 is a deficient number, since it is larger than the sum of its proper divisors (18353429).
152671051 is a wasteful number, since it uses less digits than its factorization.
152671051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31206 (or 31193 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 28.
The square root of 152671051 is about 12356.0127468371. The cubic root of 152671051 is about 534.4645424360.
The spelling of 152671051 in words is "one hundred fifty-two million, six hundred seventy-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •