Base | Representation |
---|---|
bin | 10001011101011… |
… | …11110010111111 |
3 | 101012121112222121 |
4 | 20232233302333 |
5 | 244444102002 |
6 | 22311223411 |
7 | 3425664304 |
oct | 1056576277 |
9 | 335545877 |
10 | 146472127 |
11 | 7575274a |
12 | 41077b67 |
13 | 244651c9 |
14 | 1564b0ab |
15 | ccd4237 |
hex | 8bafcbf |
146472127 has 4 divisors (see below), whose sum is σ = 151522920. Its totient is φ = 141421336.
The previous prime is 146472107. The next prime is 146472133. The reversal of 146472127 is 721274641.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 721274641 = 23 ⋅31359767.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146472127 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146472092 and 146472101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146472107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2525353 + ... + 2525410.
It is an arithmetic number, because the mean of its divisors is an integer number (37880730).
Almost surely, 2146472127 is an apocalyptic number.
146472127 is a deficient number, since it is larger than the sum of its proper divisors (5050793).
146472127 is an equidigital number, since it uses as much as digits as its factorization.
146472127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5050792.
The product of its digits is 18816, while the sum is 34.
The square root of 146472127 is about 12102.5669591207. The cubic root of 146472127 is about 527.1307233319.
The spelling of 146472127 in words is "one hundred forty-six million, four hundred seventy-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •