Base | Representation |
---|---|
bin | 1000010001110011111… |
… | …1011110011110100001 |
3 | 111121002120121221221001 |
4 | 2010130333132132201 |
5 | 4312231400311341 |
6 | 145200215032001 |
7 | 13163231540251 |
oct | 2043477363641 |
9 | 447076557831 |
10 | 142220322721 |
11 | 553517344a4 |
12 | 2369136b601 |
13 | 1054688a919 |
14 | 6c52479961 |
15 | 3a75b04d31 |
hex | 211cfde7a1 |
142220322721 has 4 divisors (see below), whose sum is σ = 142233716272. Its totient is φ = 142206929172.
The previous prime is 142220322701. The next prime is 142220322731. The reversal of 142220322721 is 127223022241.
It is a happy number.
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.
It is a cyclic number.
It is not a de Polignac number, because 142220322721 - 25 = 142220322689 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 142220322721.
It is not an unprimeable number, because it can be changed into a prime (142220322701) 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, 6680835 + ... + 6702088.
It is an arithmetic number, because the mean of its divisors is an integer number (35558429068).
Almost surely, 2142220322721 is an apocalyptic number.
It is an amenable number.
142220322721 is a deficient number, since it is larger than the sum of its proper divisors (13393551).
142220322721 is a wasteful number, since it uses less digits than its factorization.
142220322721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13393550.
The product of its (nonzero) digits is 5376, while the sum is 28.
Adding to 142220322721 its reverse (127223022241), we get a palindrome (269443344962).
The spelling of 142220322721 in words is "one hundred forty-two billion, two hundred twenty million, three hundred twenty-two thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •