Base | Representation |
---|---|
bin | 1000010011010001001… |
… | …0101001000011000001 |
3 | 111122002211011201220211 |
4 | 2010310102221003001 |
5 | 4314031433111341 |
6 | 145303101234121 |
7 | 13206016251352 |
oct | 2046422510301 |
9 | 448084151824 |
10 | 142611222721 |
11 | 55532354450 |
12 | 23780262941 |
13 | 105a98641b6 |
14 | 6c8c351d29 |
15 | 3a9a0bc181 |
hex | 21344a90c1 |
142611222721 has 8 divisors (see below), whose sum is σ = 157323924000. Its totient is φ = 128189862240.
The previous prime is 142611222707. The next prime is 142611222731. The reversal of 142611222721 is 127222116241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 142611222721 - 235 = 108251484353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142611222731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72834171 + ... + 72836128.
It is an arithmetic number, because the mean of its divisors is an integer number (19665490500).
Almost surely, 2142611222721 is an apocalyptic number.
142611222721 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
142611222721 is a deficient number, since it is larger than the sum of its proper divisors (14712701279).
142611222721 is a wasteful number, since it uses less digits than its factorization.
142611222721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145670399.
The product of its digits is 5376, while the sum is 31.
Adding to 142611222721 its reverse (127222116241), we get a palindrome (269833338962).
The spelling of 142611222721 in words is "one hundred forty-two billion, six hundred eleven million, two hundred twenty-two thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •