Base | Representation |
---|---|
bin | 10010001101000… |
… | …00100100101011 |
3 | 101122100000201000 |
4 | 21012200210223 |
5 | 303042414402 |
6 | 23052530043 |
7 | 3532640040 |
oct | 1106404453 |
9 | 348300630 |
10 | 152701227 |
11 | 79217768 |
12 | 43180923 |
13 | 25836573 |
14 | 163cd1c7 |
15 | d614c1c |
hex | 91a092b |
152701227 has 16 divisors (see below), whose sum is σ = 258542080. Its totient is φ = 87257736.
The previous prime is 152701217. The next prime is 152701229. The reversal of 152701227 is 722107251.
It is not a de Polignac number, because 152701227 - 212 = 152697131 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 152701227.
It is not an unprimeable number, because it can be changed into a prime (152701229) 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 15 ways as a sum of consecutive naturals, for example, 403783 + ... + 404160.
It is an arithmetic number, because the mean of its divisors is an integer number (16158880).
Almost surely, 2152701227 is an apocalyptic number.
152701227 is a deficient number, since it is larger than the sum of its proper divisors (105840853).
152701227 is an equidigital number, since it uses as much as digits as its factorization.
152701227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 807959 (or 807953 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 27.
The square root of 152701227 is about 12357.2337923987. The cubic root of 152701227 is about 534.4997530833.
Adding to 152701227 its reverse (722107251), we get a palindrome (874808478).
The spelling of 152701227 in words is "one hundred fifty-two million, seven hundred one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •