Base | Representation |
---|---|
bin | 10001000100101… |
… | …00100111000101 |
3 | 100222111002002221 |
4 | 20202110213011 |
5 | 243130340140 |
6 | 22113332341 |
7 | 3356210401 |
oct | 1042244705 |
9 | 328432087 |
10 | 143215045 |
11 | 73928646 |
12 | 3bb670b1 |
13 | 2389483c |
14 | 15040101 |
15 | c88e14a |
hex | 88949c5 |
143215045 has 8 divisors (see below), whose sum is σ = 171922680. Its totient is φ = 114528960.
The previous prime is 143215019. The next prime is 143215097. The reversal of 143215045 is 540512341.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 8631844 + 134583201 = 2938^2 + 11601^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 143215045 - 211 = 143212997 is a prime.
It is a super-2 number, since 2×1432150452 = 41021098228704050, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20955 + ... + 26935.
It is an arithmetic number, because the mean of its divisors is an integer number (21490335).
Almost surely, 2143215045 is an apocalyptic number.
It is an amenable number.
143215045 is a deficient number, since it is larger than the sum of its proper divisors (28707635).
143215045 is an equidigital number, since it uses as much as digits as its factorization.
143215045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10775.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 143215045 is about 11967.2488484196. The cubic root of 143215045 is about 523.1941522947.
Adding to 143215045 its reverse (540512341), we get a palindrome (683727386).
The spelling of 143215045 in words is "one hundred forty-three million, two hundred fifteen thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •