Base | Representation |
---|---|
bin | 10001011011000… |
… | …00010011100001 |
3 | 101012000000100102 |
4 | 20231200103201 |
5 | 244403142104 |
6 | 22300232145 |
7 | 3423140114 |
oct | 1055402341 |
9 | 335000312 |
10 | 146146529 |
11 | 75550061 |
12 | 40b3b655 |
13 | 2437cc49 |
14 | 155a457b |
15 | cc6ca1e |
hex | 8b604e1 |
146146529 has 2 divisors, whose sum is σ = 146146530. Its totient is φ = 146146528.
The previous prime is 146146513. The next prime is 146146607. The reversal of 146146529 is 925641641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91164304 + 54982225 = 9548^2 + 7415^2 .
It is a cyclic number.
It is not a de Polignac number, because 146146529 - 24 = 146146513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 146146492 and 146146501.
It is not a weakly prime, because it can be changed into another prime (146146729) 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 as a sum of consecutive naturals, namely, 73073264 + 73073265.
It is an arithmetic number, because the mean of its divisors is an integer number (73073265).
Almost surely, 2146146529 is an apocalyptic number.
It is an amenable number.
146146529 is a deficient number, since it is larger than the sum of its proper divisors (1).
146146529 is an equidigital number, since it uses as much as digits as its factorization.
146146529 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51840, while the sum is 38.
The square root of 146146529 is about 12089.1078661744. The cubic root of 146146529 is about 526.7398411297.
The spelling of 146146529 in words is "one hundred forty-six million, one hundred forty-six thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •