Base | Representation |
---|---|
bin | 100000010111101001111001… |
… | …111001111100001101111101 |
3 | 200200001202212102101102100002 |
4 | 200113221321321330031331 |
5 | 122124433441443201323 |
6 | 1222440401303044045 |
7 | 41662250425220501 |
oct | 4027517171741575 |
9 | 620052772342302 |
10 | 142363031225213 |
11 | 413a7905803797 |
12 | 13b72aab140625 |
13 | 6158a12528926 |
14 | 272259c186301 |
15 | 116d2c858b828 |
hex | 817a79e7c37d |
142363031225213 has 8 divisors (see below), whose sum is σ = 143140872312000. Its totient is φ = 141585604662528.
The previous prime is 142363031225209. The next prime is 142363031225237. The reversal of 142363031225213 is 312522130363241.
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 142363031225213 - 22 = 142363031225209 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142363031225263) 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, 102942263 + ... + 104316036.
It is an arithmetic number, because the mean of its divisors is an integer number (17892609039000).
Almost surely, 2142363031225213 is an apocalyptic number.
It is an amenable number.
142363031225213 is a deficient number, since it is larger than the sum of its proper divisors (777841086787).
142363031225213 is a wasteful number, since it uses less digits than its factorization.
142363031225213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207262051.
The product of its (nonzero) digits is 155520, while the sum is 38.
Adding to 142363031225213 its reverse (312522130363241), we get a palindrome (454885161588454).
The spelling of 142363031225213 in words is "one hundred forty-two trillion, three hundred sixty-three billion, thirty-one million, two hundred twenty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •