Base | Representation |
---|---|
bin | 10001010100101… |
… | …00001100111101 |
3 | 101010102112120022 |
4 | 20222110030331 |
5 | 244144414100 |
6 | 22230301525 |
7 | 3413055563 |
oct | 1052241475 |
9 | 333375508 |
10 | 145310525 |
11 | 75029a48 |
12 | 407b78a5 |
13 | 24149579 |
14 | 15427a33 |
15 | cb54e85 |
hex | 8a9433d |
145310525 has 6 divisors (see below), whose sum is σ = 180185082. Its totient is φ = 116248400.
The previous prime is 145310513. The next prime is 145310531. The reversal of 145310525 is 525013541.
It can be written as a sum of positive squares in 3 ways, for example, as 276676 + 145033849 = 526^2 + 12043^2 .
It is not a de Polignac number, because 145310525 - 210 = 145309501 is a prime.
It is a super-2 number, since 2×1453105252 = 42230297351551250, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145310494 and 145310503.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 2906186 + ... + 2906235.
It is an arithmetic number, because the mean of its divisors is an integer number (30030847).
Almost surely, 2145310525 is an apocalyptic number.
It is an amenable number.
145310525 is a deficient number, since it is larger than the sum of its proper divisors (34874557).
145310525 is an equidigital number, since it uses as much as digits as its factorization.
145310525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5812431 (or 5812426 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 145310525 is about 12054.4815317790. The cubic root of 145310525 is about 525.7335475258.
The spelling of 145310525 in words is "one hundred forty-five million, three hundred ten thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •