Base | Representation |
---|---|
bin | 10001010011100… |
… | …00000000001011 |
3 | 101010011000011200 |
4 | 20221300000023 |
5 | 244130143001 |
6 | 22223155243 |
7 | 3411600363 |
oct | 1051600013 |
9 | 333130150 |
10 | 145162251 |
11 | 74a38603 |
12 | 40745b23 |
13 | 240c6c30 |
14 | 153c99a3 |
15 | cb26086 |
hex | 8a7000b |
145162251 has 12 divisors (see below), whose sum is σ = 225808128. Its totient is φ = 89330544.
The previous prime is 145162183. The next prime is 145162289. The reversal of 145162251 is 152261541.
It is not a de Polignac number, because 145162251 - 211 = 145160203 is a prime.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (145162291) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 620235 + ... + 620468.
It is an arithmetic number, because the mean of its divisors is an integer number (18817344).
Almost surely, 2145162251 is an apocalyptic number.
145162251 is a deficient number, since it is larger than the sum of its proper divisors (80645877).
145162251 is a wasteful number, since it uses less digits than its factorization.
145162251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1240722 (or 1240719 counting only the distinct ones).
The product of its digits is 2400, while the sum is 27.
The square root of 145162251 is about 12048.3298012629. The cubic root of 145162251 is about 525.5546682024.
The spelling of 145162251 in words is "one hundred forty-five million, one hundred sixty-two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •