Base | Representation |
---|---|
bin | 1000011100101100110… |
… | …1111100001100010011 |
3 | 111212122021211010120221 |
4 | 2013023031330030103 |
5 | 4334223144200120 |
6 | 150402233413511 |
7 | 13325534055625 |
oct | 2071315741423 |
9 | 455567733527 |
10 | 145143350035 |
11 | 56611701152 |
12 | 2416826a297 |
13 | 108c1331998 |
14 | 704c766c15 |
15 | 3b975420aa |
hex | 21cb37c313 |
145143350035 has 8 divisors (see below), whose sum is σ = 178222532400. Its totient is φ = 113414338464.
The previous prime is 145143349999. The next prime is 145143350039. The reversal of 145143350035 is 530053341541.
145143350035 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145143350035 - 233 = 136553415443 is a prime.
It is not an unprimeable number, because it can be changed into a prime (145143350039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 337542460 + ... + 337542889.
It is an arithmetic number, because the mean of its divisors is an integer number (22277816550).
Almost surely, 2145143350035 is an apocalyptic number.
145143350035 is a deficient number, since it is larger than the sum of its proper divisors (33079182365).
145143350035 is an equidigital number, since it uses as much as digits as its factorization.
145143350035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675085397.
The product of its (nonzero) digits is 54000, while the sum is 34.
Adding to 145143350035 its reverse (530053341541), we get a palindrome (675196691576).
The spelling of 145143350035 in words is "one hundred forty-five billion, one hundred forty-three million, three hundred fifty thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •