Base | Representation |
---|---|
bin | 10001010011000… |
… | …01001010011101 |
3 | 101010000220210111 |
4 | 20221201022131 |
5 | 244121221334 |
6 | 22222010021 |
7 | 3411225232 |
oct | 1051411235 |
9 | 333026714 |
10 | 145101469 |
11 | 749a6977 |
12 | 40716911 |
13 | 240a5376 |
14 | 153b1789 |
15 | cb13064 |
hex | 8a6129d |
145101469 has 2 divisors, whose sum is σ = 145101470. Its totient is φ = 145101468.
The previous prime is 145101403. The next prime is 145101491. The reversal of 145101469 is 964101541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 143113369 + 1988100 = 11963^2 + 1410^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145101469 is a prime.
It is a super-2 number, since 2×1451014692 = 42108872611915922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 145101469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145101269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72550734 + 72550735.
It is an arithmetic number, because the mean of its divisors is an integer number (72550735).
Almost surely, 2145101469 is an apocalyptic number.
It is an amenable number.
145101469 is a deficient number, since it is larger than the sum of its proper divisors (1).
145101469 is an equidigital number, since it uses as much as digits as its factorization.
145101469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4320, while the sum is 31.
The square root of 145101469 is about 12045.8071128505. The cubic root of 145101469 is about 525.4813049527.
The spelling of 145101469 in words is "one hundred forty-five million, one hundred one thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •