Base | Representation |
---|---|
bin | 10001010011001… |
… | …10111100011110 |
3 | 101010002010021120 |
4 | 20221212330132 |
5 | 244123001100 |
6 | 22222311410 |
7 | 3411354252 |
oct | 1051467436 |
9 | 333063246 |
10 | 145125150 |
11 | 74a12745 |
12 | 40728566 |
13 | 240b3091 |
14 | 153ba262 |
15 | cb1a0a0 |
hex | 8a66f1e |
145125150 has 24 divisors (see below), whose sum is σ = 359910744. Its totient is φ = 38700000.
The previous prime is 145125103. The next prime is 145125151. The reversal of 145125150 is 51521541.
It is a super-2 number, since 2×1451251502 = 42122618325045000, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 145125150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145125151) 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, 483601 + ... + 483900.
It is an arithmetic number, because the mean of its divisors is an integer number (14996281).
Almost surely, 2145125150 is an apocalyptic number.
145125150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145125150 is an abundant number, since it is smaller than the sum of its proper divisors (214785594).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145125150 is a wasteful number, since it uses less digits than its factorization.
145125150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 967516 (or 967511 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 24.
The square root of 145125150 is about 12046.7900288832. The cubic root of 145125150 is about 525.5098901121.
Adding to 145125150 its reverse (51521541), we get a palindrome (196646691).
The spelling of 145125150 in words is "one hundred forty-five million, one hundred twenty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •