Base | Representation |
---|---|
bin | 1000010001000111011… |
… | …0100101001000110011 |
3 | 111120121112222101212002 |
4 | 2010101312211020303 |
5 | 4311341030110311 |
6 | 145125501324215 |
7 | 13155502221455 |
oct | 2042166451063 |
9 | 446545871762 |
10 | 142033441331 |
11 | 552661a1771 |
12 | 2363a86666b |
13 | 10516c47812 |
14 | 6c357102d5 |
15 | 3a644dc93b |
hex | 2111da5233 |
142033441331 has 4 divisors (see below), whose sum is σ = 144361858464. Its totient is φ = 139705024200.
The previous prime is 142033441289. The next prime is 142033441349. The reversal of 142033441331 is 133144330241.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 142033441331 - 226 = 141966332467 is a prime.
It is a super-2 number, since 2×1420334413312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142033441294 and 142033441303.
It is not an unprimeable number, because it can be changed into a prime (142033441031) 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, 1164208475 + ... + 1164208596.
It is an arithmetic number, because the mean of its divisors is an integer number (36090464616).
Almost surely, 2142033441331 is an apocalyptic number.
142033441331 is a deficient number, since it is larger than the sum of its proper divisors (2328417133).
142033441331 is an equidigital number, since it uses as much as digits as its factorization.
142033441331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2328417132.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 142033441331 its reverse (133144330241), we get a palindrome (275177771572).
The spelling of 142033441331 in words is "one hundred forty-two billion, thirty-three million, four hundred forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.320 sec. • engine limits •