Base | Representation |
---|---|
bin | 10001010011011… |
… | …01011000011001 |
3 | 101010010110102222 |
4 | 20221231120121 |
5 | 244124322023 |
6 | 22223033425 |
7 | 3411524153 |
oct | 1051553031 |
9 | 333113388 |
10 | 145151513 |
11 | 74a30531 |
12 | 4073b875 |
13 | 240c2090 |
14 | 153c5ad3 |
15 | cb22cc8 |
hex | 8a6d619 |
145151513 has 8 divisors (see below), whose sum is σ = 158880456. Its totient is φ = 131788800.
The previous prime is 145151509. The next prime is 145151527. The reversal of 145151513 is 315151541.
It can be written as a sum of positive squares in 4 ways, for example, as 262144 + 144889369 = 512^2 + 12037^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145151513 - 22 = 145151509 is a prime.
It is a Duffinian number.
It is a zygodrome in base 9.
It is not an unprimeable number, because it can be changed into a prime (145151563) 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, 90728 + ... + 92313.
It is an arithmetic number, because the mean of its divisors is an integer number (19860057).
Almost surely, 2145151513 is an apocalyptic number.
145151513 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
145151513 is a deficient number, since it is larger than the sum of its proper divisors (13728943).
145151513 is a wasteful number, since it uses less digits than its factorization.
145151513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183115.
The product of its digits is 1500, while the sum is 26.
The square root of 145151513 is about 12047.8841710900. The cubic root of 145151513 is about 525.5417090363.
The spelling of 145151513 in words is "one hundred forty-five million, one hundred fifty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.484 sec. • engine limits •