Base | Representation |
---|---|
bin | 10001100001011… |
… | …10101110100001 |
3 | 101020120222011101 |
4 | 20300232232201 |
5 | 300112221113 |
6 | 22330314401 |
7 | 3433261126 |
oct | 1060565641 |
9 | 336528141 |
10 | 146992033 |
11 | 75a78321 |
12 | 41288a01 |
13 | 245b7a46 |
14 | 1574474d |
15 | cd882dd |
hex | 8c2eba1 |
146992033 has 2 divisors, whose sum is σ = 146992034. Its totient is φ = 146992032.
The previous prime is 146992031. The next prime is 146992063. The reversal of 146992033 is 330299641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84787264 + 62204769 = 9208^2 + 7887^2 .
It is a cyclic number.
It is not a de Polignac number, because 146992033 - 21 = 146992031 is a prime.
Together with 146992031, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 146991983 and 146992001.
It is not a weakly prime, because it can be changed into another prime (146992031) 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, 73496016 + 73496017.
It is an arithmetic number, because the mean of its divisors is an integer number (73496017).
Almost surely, 2146992033 is an apocalyptic number.
It is an amenable number.
146992033 is a deficient number, since it is larger than the sum of its proper divisors (1).
146992033 is an equidigital number, since it uses as much as digits as its factorization.
146992033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 37.
The square root of 146992033 is about 12124.0270949879. The cubic root of 146992033 is about 527.7536741749.
The spelling of 146992033 in words is "one hundred forty-six million, nine hundred ninety-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •