Base | Representation |
---|---|
bin | 10001010010011… |
… | …01000001010101 |
3 | 101002212201121210 |
4 | 20221031001111 |
5 | 244111101330 |
6 | 22220132033 |
7 | 3410432550 |
oct | 1051150125 |
9 | 332781553 |
10 | 145018965 |
11 | 7494a993 |
12 | 40697019 |
13 | 24076950 |
14 | 1538d697 |
15 | cae88b0 |
hex | 8a4d055 |
145018965 has 64 divisors (see below), whose sum is σ = 288110592. Its totient is φ = 60652800.
The previous prime is 145018943. The next prime is 145018997. The reversal of 145018965 is 569810541.
145018965 is a nontrivial binomial coefficient, being equal to C(17031, 2).
It is not a de Polignac number, because 145018965 - 26 = 145018901 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is an unprimeable number.
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 in 63 ways as a sum of consecutive naturals, for example, 178410 + ... + 179220.
It is an arithmetic number, because the mean of its divisors is an integer number (4501728).
Almost surely, 2145018965 is an apocalyptic number.
145018965 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
145018965 is the 17030-th triangular number.
It is an amenable number.
145018965 is a deficient number, since it is larger than the sum of its proper divisors (143091627).
145018965 is a wasteful number, since it uses less digits than its factorization.
145018965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 970.
The product of its (nonzero) digits is 43200, while the sum is 39.
The square root of 145018965 is about 12042.3820318075. The cubic root of 145018965 is about 525.3816906862.
The spelling of 145018965 in words is "one hundred forty-five million, eighteen thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •