Base | Representation |
---|---|
bin | 1000010001110100000… |
… | …0010010101100110111 |
3 | 111121002121000211100122 |
4 | 2010131000102230313 |
5 | 4312231424133011 |
6 | 145200223402155 |
7 | 13163233421015 |
oct | 2043500225467 |
9 | 447077024318 |
10 | 142220536631 |
11 | 55351870188 |
12 | 2369145335b |
13 | 105469340b4 |
14 | 6c524d38b5 |
15 | 3a75b483db |
hex | 211d012b37 |
142220536631 has 8 divisors (see below), whose sum is σ = 142421227200. Its totient is φ = 142019917920.
The previous prime is 142220536583. The next prime is 142220536637. The reversal of 142220536631 is 136635022241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 142220536631 - 26 = 142220536567 is a prime.
It is a super-2 number, since 2×1422205366312 (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 = 142220536591 and 142220536600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142220536637) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4850786 + ... + 4880016.
It is an arithmetic number, because the mean of its divisors is an integer number (17802653400).
Almost surely, 2142220536631 is an apocalyptic number.
142220536631 is a deficient number, since it is larger than the sum of its proper divisors (200690569).
142220536631 is an equidigital number, since it uses as much as digits as its factorization.
142220536631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35929.
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 142220536631 its reverse (136635022241), we get a palindrome (278855558872).
The spelling of 142220536631 in words is "one hundred forty-two billion, two hundred twenty million, five hundred thirty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •