Base | Representation |
---|---|
bin | 100000111110000100100110… |
… | …001110110101111001001001 |
3 | 201000102011011122011201210022 |
4 | 200332010212032311321021 |
5 | 123001212202232231400 |
6 | 1232221250132230225 |
7 | 42354060213153233 |
oct | 4076044616657111 |
9 | 630364148151708 |
10 | 145003032305225 |
11 | 42225493573586 |
12 | 1431a68616b375 |
13 | 62ba95ba8a4c3 |
14 | 27b4281689253 |
15 | 11b6cdd033b85 |
hex | 83e1263b5e49 |
145003032305225 has 12 divisors (see below), whose sum is σ = 180273221584896. Its totient is φ = 115699547440080.
The previous prime is 145003032305207. The next prime is 145003032305227. The reversal of 145003032305225 is 522503230300541.
It is not a de Polignac number, because 145003032305225 - 212 = 145003032301129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145003032305227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7571950337 + ... + 7571969486.
It is an arithmetic number, because the mean of its divisors is an integer number (15022768465408).
Almost surely, 2145003032305225 is an apocalyptic number.
It is an amenable number.
145003032305225 is a deficient number, since it is larger than the sum of its proper divisors (35270189279671).
145003032305225 is a wasteful number, since it uses less digits than its factorization.
145003032305225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15143920216 (or 15143920211 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 35.
Adding to 145003032305225 its reverse (522503230300541), we get a palindrome (667506262605766).
The spelling of 145003032305225 in words is "one hundred forty-five trillion, three billion, thirty-two million, three hundred five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •