Base | Representation |
---|---|
bin | 100000001011101000011101… |
… | …111011100100100000101101 |
3 | 200120010210100201222120211012 |
4 | 200023220131323210200231 |
5 | 122022414434213141233 |
6 | 1221005044443035005 |
7 | 41545462124263514 |
oct | 4013503573444055 |
9 | 616123321876735 |
10 | 141536854427693 |
11 | 4110949651463a |
12 | 13a5a95a20ba65 |
13 | 60c8b392b656a |
14 | 26d45c546767b |
15 | 1156a72121548 |
hex | 80ba1dee482d |
141536854427693 has 2 divisors, whose sum is σ = 141536854427694. Its totient is φ = 141536854427692.
The previous prime is 141536854427651. The next prime is 141536854427819. The reversal of 141536854427693 is 396724458635141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75499728927364 + 66037125500329 = 8689058^2 + 8126323^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141536854427693 is a prime.
It is a super-2 number, since 2×1415368544276932 (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 (141536854427623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70768427213846 + 70768427213847.
It is an arithmetic number, because the mean of its divisors is an integer number (70768427213847).
Almost surely, 2141536854427693 is an apocalyptic number.
It is an amenable number.
141536854427693 is a deficient number, since it is larger than the sum of its proper divisors (1).
141536854427693 is an equidigital number, since it uses as much as digits as its factorization.
141536854427693 is an evil number, because the sum of its binary digits is even.
The product of its digits is 522547200, while the sum is 68.
The spelling of 141536854427693 in words is "one hundred forty-one trillion, five hundred thirty-six billion, eight hundred fifty-four million, four hundred twenty-seven thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •