Base | Representation |
---|---|
bin | 100000010111000010111001… |
… | …111001000001100101101101 |
3 | 200122220202202222222111200102 |
4 | 200113002321321001211231 |
5 | 122123242211143211213 |
6 | 1222405234103240445 |
7 | 41656235616513542 |
oct | 4027027171014555 |
9 | 618822688874612 |
10 | 142321155053933 |
11 | 413910767a5479 |
12 | 13b66962a49125 |
13 | 6154a9a86685b |
14 | 2720548754bc9 |
15 | 116c177002158 |
hex | 8170b9e4196d |
142321155053933 has 2 divisors, whose sum is σ = 142321155053934. Its totient is φ = 142321155053932.
The previous prime is 142321155053929. The next prime is 142321155054037. The reversal of 142321155053933 is 339350551123241.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82776751937929 + 59544403116004 = 9098173^2 + 7716502^2 .
It is a cyclic number.
It is not a de Polignac number, because 142321155053933 - 22 = 142321155053929 is a prime.
It is a super-2 number, since 2×1423211550539332 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142321155053923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71160577526966 + 71160577526967.
It is an arithmetic number, because the mean of its divisors is an integer number (71160577526967).
Almost surely, 2142321155053933 is an apocalyptic number.
It is an amenable number.
142321155053933 is a deficient number, since it is larger than the sum of its proper divisors (1).
142321155053933 is an equidigital number, since it uses as much as digits as its factorization.
142321155053933 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458000, while the sum is 47.
The spelling of 142321155053933 in words is "one hundred forty-two trillion, three hundred twenty-one billion, one hundred fifty-five million, fifty-three thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •