Base | Representation |
---|---|
bin | 1000011100001101011… |
… | …0011001111111101010 |
3 | 111212022002102220200102 |
4 | 2013003112121333222 |
5 | 4333440401222110 |
6 | 150341200305402 |
7 | 13322342102423 |
oct | 2070326317752 |
9 | 455262386612 |
10 | 145011351530 |
11 | 56554144781 |
12 | 24130012262 |
13 | 1089cb96666 |
14 | 703900664a |
15 | 3b8ab6b5a5 |
hex | 21c3599fea |
145011351530 has 8 divisors (see below), whose sum is σ = 261020432772. Its totient is φ = 58004540608.
The previous prime is 145011351493. The next prime is 145011351593. The reversal of 145011351530 is 35153110541.
It can be written as a sum of positive squares in 2 ways, for example, as 124475601721 + 20535749809 = 352811^2 + 143303^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 145011351493 and 145011351502.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7250567567 + ... + 7250567586.
Almost surely, 2145011351530 is an apocalyptic number.
145011351530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145011351530 is a deficient number, since it is larger than the sum of its proper divisors (116009081242).
145011351530 is a wasteful number, since it uses less digits than its factorization.
145011351530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14501135160.
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 145011351530 in words is "one hundred forty-five billion, eleven million, three hundred fifty-one thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •