Base | Representation |
---|---|
bin | 10001010101110… |
… | …01010010011100 |
3 | 101010201020221100 |
4 | 20222321102130 |
5 | 244214244203 |
6 | 22233433100 |
7 | 3414260466 |
oct | 1052712234 |
9 | 333636840 |
10 | 145462428 |
11 | 75123091 |
12 | 4086b790 |
13 | 241a0757 |
14 | 15467136 |
15 | cb84ea3 |
hex | 8ab949c |
145462428 has 36 divisors (see below), whose sum is σ = 372740368. Its totient is φ = 47822400.
The previous prime is 145462411. The next prime is 145462439. The reversal of 145462428 is 824264541.
145462428 is a `hidden beast` number, since 1 + 4 + 5 + 4 + 624 + 28 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 145462392 and 145462401.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 25048 + ... + 30303.
Almost surely, 2145462428 is an apocalyptic number.
145462428 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
145462428 is an abundant number, since it is smaller than the sum of its proper divisors (227277940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145462428 is a wasteful number, since it uses less digits than its factorization.
145462428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55434 (or 55429 counting only the distinct ones).
The product of its digits is 61440, while the sum is 36.
The square root of 145462428 is about 12060.7805717541. The cubic root of 145462428 is about 525.9166787692.
The spelling of 145462428 in words is "one hundred forty-five million, four hundred sixty-two thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •