Base | Representation |
---|---|
bin | 10001010011011… |
… | …01100000100101 |
3 | 101010010111011101 |
4 | 20221231200211 |
5 | 244124331122 |
6 | 22223040101 |
7 | 3411525532 |
oct | 1051554045 |
9 | 333114141 |
10 | 145152037 |
11 | 74a30968 |
12 | 40740031 |
13 | 240c23a4 |
14 | 153c5d89 |
15 | cb23027 |
hex | 8a6d825 |
145152037 has 2 divisors, whose sum is σ = 145152038. Its totient is φ = 145152036.
The previous prime is 145152023. The next prime is 145152043. The reversal of 145152037 is 730251541.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138438756 + 6713281 = 11766^2 + 2591^2 .
It is a cyclic number.
It is not a de Polignac number, because 145152037 - 227 = 10934309 is a prime.
It is a super-2 number, since 2×1451520372 = 42138227690498738, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145151996 and 145152014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145155037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72576018 + 72576019.
It is an arithmetic number, because the mean of its divisors is an integer number (72576019).
Almost surely, 2145152037 is an apocalyptic number.
It is an amenable number.
145152037 is a deficient number, since it is larger than the sum of its proper divisors (1).
145152037 is an equidigital number, since it uses as much as digits as its factorization.
145152037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4200, while the sum is 28.
The square root of 145152037 is about 12047.9059176273. The cubic root of 145152037 is about 525.5423414410.
The spelling of 145152037 in words is "one hundred forty-five million, one hundred fifty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •