Base | Representation |
---|---|
bin | 10001010110001… |
… | …11100111101100 |
3 | 101010211020110120 |
4 | 20223013213230 |
5 | 244223134012 |
6 | 22235004540 |
7 | 3414623601 |
oct | 1053074754 |
9 | 333736416 |
10 | 145521132 |
11 | 751631a9 |
12 | 40899750 |
13 | 241c13a3 |
14 | 154806a8 |
15 | cb9758c |
hex | 8ac79ec |
145521132 has 12 divisors (see below), whose sum is σ = 339549336. Its totient is φ = 48507040.
The previous prime is 145521121. The next prime is 145521137. The reversal of 145521132 is 231125541.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×1455211322 = 42352799717122848, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (145521137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6063369 + ... + 6063392.
It is an arithmetic number, because the mean of its divisors is an integer number (28295778).
Almost surely, 2145521132 is an apocalyptic number.
145521132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
145521132 is an abundant number, since it is smaller than the sum of its proper divisors (194028204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145521132 is a wasteful number, since it uses less digits than its factorization.
145521132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12126768 (or 12126766 counting only the distinct ones).
The product of its digits is 1200, while the sum is 24.
The square root of 145521132 is about 12063.2139995940. The cubic root of 145521132 is about 525.9874169909.
Adding to 145521132 its reverse (231125541), we get a palindrome (376646673).
The spelling of 145521132 in words is "one hundred forty-five million, five hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •