Base | Representation |
---|---|
bin | 1000010010100100001… |
… | …0000010001110011111 |
3 | 111121121122201111010220 |
4 | 2010221002002032133 |
5 | 4313140103220111 |
6 | 145232232332423 |
7 | 13201233513555 |
oct | 2045102021637 |
9 | 447548644126 |
10 | 142422320031 |
11 | 55445761022 |
12 | 23728b44113 |
13 | 10579694064 |
14 | 6c7121bbd5 |
15 | 3a88705e06 |
hex | 212908239f |
142422320031 has 4 divisors (see below), whose sum is σ = 189896426712. Its totient is φ = 94948213352.
The previous prime is 142422320017. The next prime is 142422320069. The reversal of 142422320031 is 130023224241.
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 142422320031 - 215 = 142422287263 is a prime.
It is a super-2 number, since 2×1424223200312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 142422319983 and 142422320010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142422390031) 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, 23737053336 + ... + 23737053341.
It is an arithmetic number, because the mean of its divisors is an integer number (47474106678).
Almost surely, 2142422320031 is an apocalyptic number.
142422320031 is a deficient number, since it is larger than the sum of its proper divisors (47474106681).
142422320031 is an equidigital number, since it uses as much as digits as its factorization.
142422320031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47474106680.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 142422320031 its reverse (130023224241), we get a palindrome (272445544272).
The spelling of 142422320031 in words is "one hundred forty-two billion, four hundred twenty-two million, three hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •