Base | Representation |
---|---|
bin | 100000010101100101110000… |
… | …000000010100001010010111 |
3 | 200122120012121011110102102002 |
4 | 200111211300000110022113 |
5 | 122120122334042000343 |
6 | 1222251252525105515 |
7 | 41646065133020462 |
oct | 4025456000241227 |
9 | 618505534412362 |
10 | 142221131203223 |
11 | 41352708959a46 |
12 | 13b4b4a90b829b |
13 | 614851a126087 |
14 | 271977a4862d9 |
15 | 1169770b558b8 |
hex | 815970014297 |
142221131203223 has 4 divisors (see below), whose sum is σ = 142221817240008. Its totient is φ = 142220445166440.
The previous prime is 142221131203201. The next prime is 142221131203279. The reversal of 142221131203223 is 322302131122241.
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 142221131203223 - 26 = 142221131203159 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 342707336 + ... + 343122077.
It is an arithmetic number, because the mean of its divisors is an integer number (35555454310002).
Almost surely, 2142221131203223 is an apocalyptic number.
142221131203223 is a deficient number, since it is larger than the sum of its proper divisors (686036785).
142221131203223 is an equidigital number, since it uses as much as digits as its factorization.
142221131203223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686036784.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 142221131203223 its reverse (322302131122241), we get a palindrome (464523262325464).
The spelling of 142221131203223 in words is "one hundred forty-two trillion, two hundred twenty-one billion, one hundred thirty-one million, two hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •