Base | Representation |
---|---|
bin | 1001001101000110010… |
… | …0111011110010000101 |
3 | 120010011200210102120022 |
4 | 2103101210323302011 |
5 | 10042330021132403 |
6 | 200351324344525 |
7 | 14265505556546 |
oct | 2232144736205 |
9 | 503150712508 |
10 | 158134942853 |
11 | 61079064118 |
12 | 267930a5145 |
13 | 11bb1a4bb04 |
14 | 7921d444cd |
15 | 41a7d82d38 |
hex | 24d193bc85 |
158134942853 has 2 divisors, whose sum is σ = 158134942854. Its totient is φ = 158134942852.
The previous prime is 158134942841. The next prime is 158134942967. The reversal of 158134942853 is 358249431851.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 136664781124 + 21470161729 = 369682^2 + 146527^2 .
It is an emirp because it is prime and its reverse (358249431851) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 158134942853 - 28 = 158134942597 is a prime.
It is a super-2 number, since 2×1581349428532 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 158134942795 and 158134942804.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (158134944853) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 79067471426 + 79067471427.
It is an arithmetic number, because the mean of its divisors is an integer number (79067471427).
Almost surely, 2158134942853 is an apocalyptic number.
It is an amenable number.
158134942853 is a deficient number, since it is larger than the sum of its proper divisors (1).
158134942853 is an equidigital number, since it uses as much as digits as its factorization.
158134942853 is an evil number, because the sum of its binary digits is even.
The product of its digits is 4147200, while the sum is 53.
The spelling of 158134942853 in words is "one hundred fifty-eight billion, one hundred thirty-four million, nine hundred forty-two thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •