Base | Representation |
---|---|
bin | 10001010011000… |
… | …01100111011001 |
3 | 101010001000100002 |
4 | 20221201213121 |
5 | 244121301241 |
6 | 22222022345 |
7 | 3411233516 |
oct | 1051414731 |
9 | 333030302 |
10 | 145103321 |
11 | 749a8300 |
12 | 407179b5 |
13 | 240a616c |
14 | 153b230d |
15 | cb1389b |
hex | 8a619d9 |
145103321 has 12 divisors (see below), whose sum is σ = 159912816. Its totient is φ = 131565720.
The previous prime is 145103317. The next prime is 145103363. The reversal of 145103321 is 123301541.
It is not a de Polignac number, because 145103321 - 22 = 145103317 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145103293 and 145103302.
It is not an unprimeable number, because it can be changed into a prime (145103311) 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 11 ways as a sum of consecutive naturals, for example, 52250 + ... + 54956.
It is an arithmetic number, because the mean of its divisors is an integer number (13326068).
Almost surely, 2145103321 is an apocalyptic number.
145103321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
145103321 is a deficient number, since it is larger than the sum of its proper divisors (14809495).
145103321 is a wasteful number, since it uses less digits than its factorization.
145103321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3172 (or 3161 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 145103321 is about 12045.8839858269. The cubic root of 145103321 is about 525.4835406002.
Adding to 145103321 its reverse (123301541), we get a palindrome (268404862).
The spelling of 145103321 in words is "one hundred forty-five million, one hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •