Base | Representation |
---|---|
bin | 10001100011010… |
… | …00110110101111 |
3 | 101021001001202200 |
4 | 20301220312233 |
5 | 300142331002 |
6 | 22335352543 |
7 | 3435302232 |
oct | 1061506657 |
9 | 337031680 |
10 | 147230127 |
11 | 761201a0 |
12 | 41382753 |
13 | 2466c225 |
14 | 157a7419 |
15 | cdd3b1c |
hex | 8c68daf |
147230127 has 12 divisors (see below), whose sum is σ = 231999144. Its totient is φ = 89230320.
The previous prime is 147230113. The next prime is 147230159. The reversal of 147230127 is 721032741.
It is a happy number.
It is not a de Polignac number, because 147230127 - 26 = 147230063 is a prime.
It is a super-2 number, since 2×1472301272 = 43353420592872258, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a self number, because there is not a number n which added to its sum of digits gives 147230127.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (147230177) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 743488 + ... + 743685.
It is an arithmetic number, because the mean of its divisors is an integer number (19333262).
Almost surely, 2147230127 is an apocalyptic number.
147230127 is a deficient number, since it is larger than the sum of its proper divisors (84769017).
147230127 is a wasteful number, since it uses less digits than its factorization.
147230127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1487190 (or 1487187 counting only the distinct ones).
The product of its (nonzero) digits is 2352, while the sum is 27.
The square root of 147230127 is about 12133.8422191819. The cubic root of 147230127 is about 528.0384678413.
Adding to 147230127 its reverse (721032741), we get a palindrome (868262868).
The spelling of 147230127 in words is "one hundred forty-seven million, two hundred thirty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •