Base | Representation |
---|---|
bin | 1000010001110100001… |
… | …0001000110101110101 |
3 | 111121002121221102010221 |
4 | 2010131002020311311 |
5 | 4312232040124113 |
6 | 145200242014341 |
7 | 13163240504554 |
oct | 2043502106565 |
9 | 447077842127 |
10 | 142221020533 |
11 | 553520707a9 |
12 | 236916473b1 |
13 | 10546a73427 |
14 | 6c525bbd9b |
15 | 3a75be198d |
hex | 211d088d75 |
142221020533 has 4 divisors (see below), whose sum is σ = 144343722400. Its totient is φ = 140098318668.
The previous prime is 142221020497. The next prime is 142221020581. The reversal of 142221020533 is 335020122241.
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 142221020533 - 225 = 142187466101 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142221020498 and 142221020507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142221030533) 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, 1061350833 + ... + 1061350966.
It is an arithmetic number, because the mean of its divisors is an integer number (36085930600).
Almost surely, 2142221020533 is an apocalyptic number.
It is an amenable number.
142221020533 is a deficient number, since it is larger than the sum of its proper divisors (2122701867).
142221020533 is an equidigital number, since it uses as much as digits as its factorization.
142221020533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2122701866.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 142221020533 its reverse (335020122241), we get a palindrome (477241142774).
The spelling of 142221020533 in words is "one hundred forty-two billion, two hundred twenty-one million, twenty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •