Base | Representation |
---|---|
bin | 10001010100100… |
… | …10111010100101 |
3 | 101010102021100001 |
4 | 20222102322211 |
5 | 244144232003 |
6 | 22230221301 |
7 | 3413034322 |
oct | 1052227245 |
9 | 333367301 |
10 | 145305253 |
11 | 75025a95 |
12 | 407b4831 |
13 | 24147052 |
14 | 15425b49 |
15 | cb5361d |
hex | 8a92ea5 |
145305253 has 8 divisors (see below), whose sum is σ = 151124480. Its totient is φ = 139585680.
The previous prime is 145305241. The next prime is 145305269. The reversal of 145305253 is 352503541.
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 145305253 - 29 = 145304741 is a prime.
It is a super-2 number, since 2×1453052532 = 42227233098788018, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145345253) 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, 21933 + ... + 27778.
It is an arithmetic number, because the mean of its divisors is an integer number (18890560).
Almost surely, 2145305253 is an apocalyptic number.
It is an amenable number.
145305253 is a deficient number, since it is larger than the sum of its proper divisors (5819227).
145305253 is an equidigital number, since it uses as much as digits as its factorization.
145305253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49827.
The product of its (nonzero) digits is 9000, while the sum is 28.
The square root of 145305253 is about 12054.2628559361. The cubic root of 145305253 is about 525.7271894161.
Adding to 145305253 its reverse (352503541), we get a palindrome (497808794).
The spelling of 145305253 in words is "one hundred forty-five million, three hundred five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.991 sec. • engine limits •