Base | Representation |
---|---|
bin | 10001010110011… |
… | …11011011101011 |
3 | 101010212212100201 |
4 | 20223033123223 |
5 | 244230200011 |
6 | 22235413031 |
7 | 3415116103 |
oct | 1053173353 |
9 | 333785321 |
10 | 145553131 |
11 | 75185249 |
12 | 408b4177 |
13 | 24202b19 |
14 | 1548c203 |
15 | cba1cc1 |
hex | 8acf6eb |
145553131 has 8 divisors (see below), whose sum is σ = 152192160. Its totient is φ = 138940032.
The previous prime is 145553123. The next prime is 145553171. The reversal of 145553131 is 131355541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145553131 - 23 = 145553123 is a prime.
It is a super-3 number, since 3×1455531313 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 145553131.
It is not an unprimeable number, because it can be changed into a prime (145553101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5491 + ... + 17923.
It is an arithmetic number, because the mean of its divisors is an integer number (19024020).
Almost surely, 2145553131 is an apocalyptic number.
145553131 is a deficient number, since it is larger than the sum of its proper divisors (6639029).
145553131 is a wasteful number, since it uses less digits than its factorization.
145553131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12965.
The product of its digits is 4500, while the sum is 28.
The square root of 145553131 is about 12064.5402316044. The cubic root of 145553131 is about 526.0259677215.
The spelling of 145553131 in words is "one hundred forty-five million, five hundred fifty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.613 sec. • engine limits •