Base | Representation |
---|---|
bin | 10001010011111… |
… | …00001011100100 |
3 | 101010020112121010 |
4 | 20221330023210 |
5 | 244133242012 |
6 | 22224222220 |
7 | 3412165662 |
oct | 1051741344 |
9 | 333215533 |
10 | 145212132 |
11 | 74a7202a |
12 | 4076a970 |
13 | 24113850 |
14 | 153ddc32 |
15 | cb35c3c |
hex | 8a7c2e4 |
145212132 has 24 divisors (see below), whose sum is σ = 364892416. Its totient is φ = 44680608.
The previous prime is 145212131. The next prime is 145212149. The reversal of 145212132 is 231212541.
It is a junction number, because it is equal to n+sod(n) for n = 145212099 and 145212108.
It is not an unprimeable number, because it can be changed into a prime (145212131) 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, 465268 + ... + 465579.
Almost surely, 2145212132 is an apocalyptic number.
145212132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
145212132 is an abundant number, since it is smaller than the sum of its proper divisors (219680284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145212132 is a wasteful number, since it uses less digits than its factorization.
145212132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 930867 (or 930865 counting only the distinct ones).
The product of its digits is 480, while the sum is 21.
The square root of 145212132 is about 12050.3996614220. The cubic root of 145212132 is about 525.6148587595.
Adding to 145212132 its reverse (231212541), we get a palindrome (376424673).
It can be divided in two parts, 14521 and 2132, that added together give a triangular number (16653 = T182).
The spelling of 145212132 in words is "one hundred forty-five million, two hundred twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •