Base | Representation |
---|---|
bin | 1000010011010001001… |
… | …0001101100000101101 |
3 | 111122002210222000012111 |
4 | 2010310102031200231 |
5 | 4314031421004213 |
6 | 145303055004021 |
7 | 13206015301465 |
oct | 2046422154055 |
9 | 448083860174 |
10 | 142611109933 |
11 | 55532287736 |
12 | 23780209611 |
13 | 105a9824a66 |
14 | 6c8c322ba5 |
15 | 3a9a098a3d |
hex | 213448d82d |
142611109933 has 2 divisors, whose sum is σ = 142611109934. Its totient is φ = 142611109932.
The previous prime is 142611109919. The next prime is 142611109939. The reversal of 142611109933 is 339901116241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89304150244 + 53306959689 = 298838^2 + 230883^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142611109933 is a prime.
It is a super-2 number, since 2×1426111099332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142611109939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71305554966 + 71305554967.
It is an arithmetic number, because the mean of its divisors is an integer number (71305554967).
Almost surely, 2142611109933 is an apocalyptic number.
It is an amenable number.
142611109933 is a deficient number, since it is larger than the sum of its proper divisors (1).
142611109933 is an equidigital number, since it uses as much as digits as its factorization.
142611109933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 40.
The spelling of 142611109933 in words is "one hundred forty-two billion, six hundred eleven million, one hundred nine thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •