Base | Representation |
---|---|
bin | 10001010100110… |
… | …00010101000100 |
3 | 101010110101202100 |
4 | 20222120111010 |
5 | 244200434203 |
6 | 22230512100 |
7 | 3413156061 |
oct | 1052302504 |
9 | 333411670 |
10 | 145327428 |
11 | 75040714 |
12 | 40805630 |
13 | 2415417c |
14 | 1542dc68 |
15 | cb59ea3 |
hex | 8a98544 |
145327428 has 36 divisors (see below), whose sum is σ = 386691760. Its totient is φ = 45892656.
The previous prime is 145327423. The next prime is 145327463. The reversal of 145327428 is 824723541.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×1453274282 = 42240122658190368, which contains 22 as substring.
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 = 145327392 and 145327401.
It is not an unprimeable number, because it can be changed into a prime (145327421) 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, 105550 + ... + 106917.
Almost surely, 2145327428 is an apocalyptic number.
145327428 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
145327428 is an abundant number, since it is smaller than the sum of its proper divisors (241364332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145327428 is a wasteful number, since it uses less digits than its factorization.
145327428 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212496 (or 212491 counting only the distinct ones).
The product of its digits is 53760, while the sum is 36.
The square root of 145327428 is about 12055.1826199357. The cubic root of 145327428 is about 525.7539317561.
The spelling of 145327428 in words is "one hundred forty-five million, three hundred twenty-seven thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •