Base | Representation |
---|---|
bin | 100000010111000101000111… |
… | …100100100001001111001101 |
3 | 200122220222220122201001222102 |
4 | 200113011013210201033031 |
5 | 122123312043200340323 |
6 | 1222410310014324445 |
7 | 41656351541551463 |
oct | 4027050744411715 |
9 | 618828818631872 |
10 | 142323532043213 |
11 | 41392086520724 |
12 | 13b67306ab9725 |
13 | 61550891568a1 |
14 | 27206d2304833 |
15 | 116c265a30328 |
hex | 8171479213cd |
142323532043213 has 2 divisors, whose sum is σ = 142323532043214. Its totient is φ = 142323532043212.
The previous prime is 142323532043197. The next prime is 142323532043281. The reversal of 142323532043213 is 312340235323241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98531789037124 + 43791743006089 = 9926318^2 + 6617533^2 .
It is a cyclic number.
It is not a de Polignac number, because 142323532043213 - 24 = 142323532043197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142323532043813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71161766021606 + 71161766021607.
It is an arithmetic number, because the mean of its divisors is an integer number (71161766021607).
Almost surely, 2142323532043213 is an apocalyptic number.
It is an amenable number.
142323532043213 is a deficient number, since it is larger than the sum of its proper divisors (1).
142323532043213 is an equidigital number, since it uses as much as digits as its factorization.
142323532043213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 38.
Adding to 142323532043213 its reverse (312340235323241), we get a palindrome (454663767366454).
The spelling of 142323532043213 in words is "one hundred forty-two trillion, three hundred twenty-three billion, five hundred thirty-two million, forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •