Base | Representation |
---|---|
bin | 100000010100011100000011… |
… | …010110101010101010100101 |
3 | 200122021122100022010200012201 |
4 | 200110130003112222222211 |
5 | 122112323303211402233 |
6 | 1222151044410014501 |
7 | 41640264145600312 |
oct | 4024340326525245 |
9 | 618248308120181 |
10 | 142141998934693 |
11 | 413220a084540a |
12 | 13b380a3a17431 |
13 | 6140c189ca244 |
14 | 27159d0a67d09 |
15 | 116768d93c77d |
hex | 8147035aaaa5 |
142141998934693 has 2 divisors, whose sum is σ = 142141998934694. Its totient is φ = 142141998934692.
The previous prime is 142141998934681. The next prime is 142141998934721. The reversal of 142141998934693 is 396439899141241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109993802010849 + 32148196923844 = 10487793^2 + 5669938^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142141998934693 is a prime.
It is a super-2 number, since 2×1421419989346932 (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 (142141998934613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71070999467346 + 71070999467347.
It is an arithmetic number, because the mean of its divisors is an integer number (71070999467347).
Almost surely, 2142141998934693 is an apocalyptic number.
It is an amenable number.
142141998934693 is a deficient number, since it is larger than the sum of its proper divisors (1).
142141998934693 is an equidigital number, since it uses as much as digits as its factorization.
142141998934693 is an evil number, because the sum of its binary digits is even.
The product of its digits is 362797056, while the sum is 73.
The spelling of 142141998934693 in words is "one hundred forty-two trillion, one hundred forty-one billion, nine hundred ninety-eight million, nine hundred thirty-four thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •