Base | Representation |
---|---|
bin | 1000011100010111001… |
… | …0011010000100110101 |
3 | 111212101221101120210110 |
4 | 2013011302122010311 |
5 | 4334031333340300 |
6 | 150345221013233 |
7 | 13323346515300 |
oct | 2070562320465 |
9 | 455357346713 |
10 | 145052246325 |
11 | 56575236628 |
12 | 24141854219 |
13 | 108a84b456c |
14 | 704060db37 |
15 | 3b8e548550 |
hex | 21c5c9a135 |
145052246325 has 36 divisors (see below), whose sum is σ = 278973960000. Its totient is φ = 66309596640.
The previous prime is 145052246323. The next prime is 145052246327. The reversal of 145052246325 is 523642250541.
It is an interprime number because it is at equal distance from previous prime (145052246323) and next prime (145052246327).
It is not a de Polignac number, because 145052246325 - 21 = 145052246323 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145052246323) 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 35 ways as a sum of consecutive naturals, for example, 19731325 + ... + 19738674.
Almost surely, 2145052246325 is an apocalyptic number.
145052246325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
145052246325 is a deficient number, since it is larger than the sum of its proper divisors (133921713675).
145052246325 is a wasteful number, since it uses less digits than its factorization.
145052246325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39470026 (or 39470014 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 39.
Adding to 145052246325 its reverse (523642250541), we get a palindrome (668694496866).
The spelling of 145052246325 in words is "one hundred forty-five billion, fifty-two million, two hundred forty-six thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •