Base | Representation |
---|---|
bin | 10001010010011… |
… | …10010111000011 |
3 | 101002220000010222 |
4 | 20221032113003 |
5 | 244111240301 |
6 | 22220213255 |
7 | 3410454545 |
oct | 1051162703 |
9 | 332800128 |
10 | 145024451 |
11 | 74954020 |
12 | 4069a22b |
13 | 240792b0 |
14 | 15391695 |
15 | caea31b |
hex | 8a4e5c3 |
145024451 has 8 divisors (see below), whose sum is σ = 170378544. Its totient is φ = 121698720.
The previous prime is 145024427. The next prime is 145024459. The reversal of 145024451 is 154420541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145024451 - 226 = 77915587 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 145024451.
It is not an unprimeable number, because it can be changed into a prime (145024459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 506936 + ... + 507221.
It is an arithmetic number, because the mean of its divisors is an integer number (21297318).
Almost surely, 2145024451 is an apocalyptic number.
145024451 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
145024451 is a deficient number, since it is larger than the sum of its proper divisors (25354093).
145024451 is a wasteful number, since it uses less digits than its factorization.
145024451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1014181.
The product of its (nonzero) digits is 3200, while the sum is 26.
The square root of 145024451 is about 12042.6098085091. The cubic root of 145024451 is about 525.3883155843.
Adding to 145024451 its reverse (154420541), we get a palindrome (299444992).
The spelling of 145024451 in words is "one hundred forty-five million, twenty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •