Base | Representation |
---|---|
bin | 1000010101001110000… |
… | …0110001011110010101 |
3 | 111200110022210110000012 |
4 | 2011103200301132111 |
5 | 4321120031132244 |
6 | 145431052130005 |
7 | 13225006414034 |
oct | 2052340613625 |
9 | 450408713005 |
10 | 143135020949 |
11 | 55780a95848 |
12 | 238a7766905 |
13 | 1066122c48b |
14 | 6cdbb4071b |
15 | 3acb08689e |
hex | 2153831795 |
143135020949 has 4 divisors (see below), whose sum is σ = 143259379200. Its totient is φ = 143010662700.
The previous prime is 143135020901. The next prime is 143135021027. The reversal of 143135020949 is 949020531341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 949020531341 = 2999 ⋅316445659.
It is a cyclic number.
It is not a de Polignac number, because 143135020949 - 236 = 74415544213 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 (143135022949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62177399 + ... + 62179700.
It is an arithmetic number, because the mean of its divisors is an integer number (35814844800).
Almost surely, 2143135020949 is an apocalyptic number.
It is an amenable number.
143135020949 is a deficient number, since it is larger than the sum of its proper divisors (124358251).
143135020949 is a wasteful number, since it uses less digits than its factorization.
143135020949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124358250.
The product of its (nonzero) digits is 116640, while the sum is 41.
The spelling of 143135020949 in words is "one hundred forty-three billion, one hundred thirty-five million, twenty thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •