Base | Representation |
---|---|
bin | 10001010011111… |
… | …11001110011101 |
3 | 101010021011201002 |
4 | 20221333032131 |
5 | 244134141410 |
6 | 22224400045 |
7 | 3412250231 |
oct | 1051771635 |
9 | 333234632 |
10 | 145224605 |
11 | 74a80439 |
12 | 40776025 |
13 | 24119426 |
14 | 154045c1 |
15 | cb397a5 |
hex | 8a7f39d |
145224605 has 8 divisors (see below), whose sum is σ = 180279000. Its totient is φ = 112173376.
The previous prime is 145224601. The next prime is 145224641. The reversal of 145224605 is 506422541.
It can be written as a sum of positive squares in 4 ways, for example, as 15697444 + 129527161 = 3962^2 + 11381^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145224605 - 22 = 145224601 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145224601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 500630 + ... + 500919.
It is an arithmetic number, because the mean of its divisors is an integer number (22534875).
Almost surely, 2145224605 is an apocalyptic number.
It is an amenable number.
145224605 is a deficient number, since it is larger than the sum of its proper divisors (35054395).
145224605 is a wasteful number, since it uses less digits than its factorization.
145224605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001583.
The product of its (nonzero) digits is 9600, while the sum is 29.
The square root of 145224605 is about 12050.9171850113. The cubic root of 145224605 is about 525.6299075628.
The spelling of 145224605 in words is "one hundred forty-five million, two hundred twenty-four thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •