Base | Representation |
---|---|
bin | 10001010010101… |
… | …01111100110011 |
3 | 101002221120210101 |
4 | 20221111330303 |
5 | 244113234124 |
6 | 22221013231 |
7 | 3410644306 |
oct | 1051257463 |
9 | 332846711 |
10 | 145055539 |
11 | 74975412 |
12 | 406b4217 |
13 | 2408a4a5 |
14 | 1539cb3d |
15 | cb04644 |
hex | 8a55f33 |
145055539 has 2 divisors, whose sum is σ = 145055540. Its totient is φ = 145055538.
The previous prime is 145055527. The next prime is 145055563. The reversal of 145055539 is 935550541.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 145055539 - 25 = 145055507 is a prime.
It is a super-2 number, since 2×1450555392 = 42082218789161042, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145055498 and 145055507.
It is not a weakly prime, because it can be changed into another prime (145055839) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72527769 + 72527770.
It is an arithmetic number, because the mean of its divisors is an integer number (72527770).
Almost surely, 2145055539 is an apocalyptic number.
145055539 is a deficient number, since it is larger than the sum of its proper divisors (1).
145055539 is an equidigital number, since it uses as much as digits as its factorization.
145055539 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 67500, while the sum is 37.
The square root of 145055539 is about 12043.9004894594. The cubic root of 145055539 is about 525.4258543232.
The spelling of 145055539 in words is "one hundred forty-five million, fifty-five thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •