Base | Representation |
---|---|
bin | 10000111100100… |
… | …00011001110001 |
3 | 100220110221002102 |
4 | 20132100121301 |
5 | 242342233413 |
6 | 22034430145 |
7 | 3344151152 |
oct | 1036203161 |
9 | 326427072 |
10 | 142149233 |
11 | 7326a906 |
12 | 3b732355 |
13 | 235b0695 |
14 | 14c43929 |
15 | c72d458 |
hex | 8790671 |
142149233 has 4 divisors (see below), whose sum is σ = 144831348. Its totient is φ = 139467120.
The previous prime is 142149211. The next prime is 142149239. The reversal of 142149233 is 332941241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 332941241 = 3803 ⋅87547.
It can be written as a sum of positive squares in 2 ways, for example, as 126720049 + 15429184 = 11257^2 + 3928^2 .
It is a cyclic number.
It is not a de Polignac number, because 142149233 - 26 = 142149169 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 142149196 and 142149205.
It is not an unprimeable number, because it can be changed into a prime (142149239) 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, 1340978 + ... + 1341083.
It is an arithmetic number, because the mean of its divisors is an integer number (36207837).
Almost surely, 2142149233 is an apocalyptic number.
It is an amenable number.
142149233 is a deficient number, since it is larger than the sum of its proper divisors (2682115).
142149233 is an equidigital number, since it uses as much as digits as its factorization.
142149233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2682114.
The product of its digits is 5184, while the sum is 29.
The square root of 142149233 is about 11922.6353211025. The cubic root of 142149233 is about 521.8930421434.
The spelling of 142149233 in words is "one hundred forty-two million, one hundred forty-nine thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.154 sec. • engine limits •