Base | Representation |
---|---|
bin | 10001000111111… |
… | …10110100101101 |
3 | 101000022011212211 |
4 | 20203332310231 |
5 | 243233300333 |
6 | 22130530421 |
7 | 3363001636 |
oct | 1043766455 |
9 | 330264784 |
10 | 143650093 |
11 | 740a5494 |
12 | 40136a11 |
13 | 239b7872 |
14 | 1511488d |
15 | c927ecd |
hex | 88fed2d |
143650093 has 4 divisors (see below), whose sum is σ = 144394588. Its totient is φ = 142905600.
The previous prime is 143650069. The next prime is 143650109. The reversal of 143650093 is 390056341.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 390056341 = 18059 ⋅21599.
It can be written as a sum of positive squares in 2 ways, for example, as 79602084 + 64048009 = 8922^2 + 8003^2 .
It is a cyclic number.
It is not a de Polignac number, because 143650093 - 29 = 143649581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143650033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 371958 + ... + 372343.
It is an arithmetic number, because the mean of its divisors is an integer number (36098647).
Almost surely, 2143650093 is an apocalyptic number.
It is an amenable number.
143650093 is a deficient number, since it is larger than the sum of its proper divisors (744495).
143650093 is an equidigital number, since it uses as much as digits as its factorization.
143650093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 744494.
The product of its (nonzero) digits is 9720, while the sum is 31.
The square root of 143650093 is about 11985.4116741979. The cubic root of 143650093 is about 523.7233901758.
It can be divided in two parts, 1436 and 50093, that added together give a square (51529 = 2272).
The spelling of 143650093 in words is "one hundred forty-three million, six hundred fifty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •