Base | Representation |
---|---|
bin | 10001010110100… |
… | …11111000100001 |
3 | 101010220210100220 |
4 | 20223103320201 |
5 | 244231240421 |
6 | 22240033253 |
7 | 3415223205 |
oct | 1053237041 |
9 | 333823326 |
10 | 145571361 |
11 | 75197a11 |
12 | 40902829 |
13 | 2420b200 |
14 | 15494b05 |
15 | cba73c6 |
hex | 8ad3e21 |
145571361 has 48 divisors (see below), whose sum is σ = 221356800. Its totient is φ = 84963840.
The previous prime is 145571359. The next prime is 145571411. The reversal of 145571361 is 163175541.
It is not a de Polignac number, because 145571361 - 21 = 145571359 is a prime.
It is a super-2 number, since 2×1455713612 = 42382042286784642, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (145571161) 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 47 ways as a sum of consecutive naturals, for example, 976915 + ... + 977063.
It is an arithmetic number, because the mean of its divisors is an integer number (4611600).
Almost surely, 2145571361 is an apocalyptic number.
It is an amenable number.
145571361 is a deficient number, since it is larger than the sum of its proper divisors (75785439).
145571361 is a wasteful number, since it uses less digits than its factorization.
145571361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266 (or 253 counting only the distinct ones).
The product of its digits is 12600, while the sum is 33.
The square root of 145571361 is about 12065.2957278303. The cubic root of 145571361 is about 526.0479277508.
The spelling of 145571361 in words is "one hundred forty-five million, five hundred seventy-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •