Base | Representation |
---|---|
bin | 10010001000001… |
… | …00011000010001 |
3 | 101121010112002211 |
4 | 21010010120101 |
5 | 302411431312 |
6 | 23031112121 |
7 | 3524333602 |
oct | 1104043021 |
9 | 347115084 |
10 | 152061457 |
11 | 78920029 |
12 | 42b12641 |
13 | 256712c2 |
14 | 162a3da9 |
15 | d53a3a7 |
hex | 9104611 |
152061457 has 4 divisors (see below), whose sum is σ = 152492580. Its totient is φ = 151630336.
The previous prime is 152061449. The next prime is 152061473. The reversal of 152061457 is 754160251.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 754160251 = 13 ⋅58012327.
It can be written as a sum of positive squares in 2 ways, for example, as 22648081 + 129413376 = 4759^2 + 11376^2 .
It is a cyclic number.
It is not a de Polignac number, because 152061457 - 23 = 152061449 is a prime.
It is a super-3 number, since 3×1520614573 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (152067457) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 215032 + ... + 215737.
It is an arithmetic number, because the mean of its divisors is an integer number (38123145).
Almost surely, 2152061457 is an apocalyptic number.
It is an amenable number.
152061457 is a deficient number, since it is larger than the sum of its proper divisors (431123).
152061457 is an equidigital number, since it uses as much as digits as its factorization.
152061457 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 431122.
The product of its (nonzero) digits is 8400, while the sum is 31.
The square root of 152061457 is about 12331.3201645242. The cubic root of 152061457 is about 533.7522463511.
The spelling of 152061457 in words is "one hundred fifty-two million, sixty-one thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •