Base | Representation |
---|---|
bin | 100000010100010001111001… |
… | …110110111110100001000101 |
3 | 200122020121012220000220211201 |
4 | 200110101321312332201011 |
5 | 122112133444131323323 |
6 | 1222142043231302501 |
7 | 41636430132156040 |
oct | 4024217166764105 |
9 | 618217186026751 |
10 | 142131102214213 |
11 | 41318509938aa2 |
12 | 13b35b6267aa31 |
13 | 613cba02c4048 |
14 | 271527979dc57 |
15 | 1167251e9e8ad |
hex | 814479dbe845 |
142131102214213 has 8 divisors (see below), whose sum is σ = 162436957356032. Its totient is φ = 121825600064496.
The previous prime is 142131102214193. The next prime is 142131102214219. The reversal of 142131102214213 is 312412201131241.
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 142131102214213 - 29 = 142131102213701 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 (142131102214219) 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, 87384645 + ... + 88996282.
It is an arithmetic number, because the mean of its divisors is an integer number (20304619669504).
Almost surely, 2142131102214213 is an apocalyptic number.
It is an amenable number.
142131102214213 is a deficient number, since it is larger than the sum of its proper divisors (20305855141819).
142131102214213 is a wasteful number, since it uses less digits than its factorization.
142131102214213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176496051.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 142131102214213 its reverse (312412201131241), we get a palindrome (454543303345454).
The spelling of 142131102214213 in words is "one hundred forty-two trillion, one hundred thirty-one billion, one hundred two million, two hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •