Base | Representation |
---|---|
bin | 10001100001000… |
… | …11101010101011 |
3 | 101020111200000112 |
4 | 20300203222223 |
5 | 300104243411 |
6 | 22325324535 |
7 | 3433012061 |
oct | 1060435253 |
9 | 336450015 |
10 | 146946731 |
11 | 75a47288 |
12 | 4126674b |
13 | 245a0239 |
14 | 15732031 |
15 | cd79b8b |
hex | 8c23aab |
146946731 has 2 divisors, whose sum is σ = 146946732. Its totient is φ = 146946730.
The previous prime is 146946713. The next prime is 146946733. The reversal of 146946731 is 137649641.
Together with previous prime (146946713) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 146946731 - 210 = 146945707 is a prime.
It is a super-2 number, since 2×1469467312 = 43186683503172722, which contains 22 as substring.
Together with 146946733, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (146946733) 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 as a sum of consecutive naturals, namely, 73473365 + 73473366.
It is an arithmetic number, because the mean of its divisors is an integer number (73473366).
Almost surely, 2146946731 is an apocalyptic number.
146946731 is a deficient number, since it is larger than the sum of its proper divisors (1).
146946731 is an equidigital number, since it uses as much as digits as its factorization.
146946731 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 108864, while the sum is 41.
The square root of 146946731 is about 12122.1586773974. The cubic root of 146946731 is about 527.6994518405.
The spelling of 146946731 in words is "one hundred forty-six million, nine hundred forty-six thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •