Base | Representation |
---|---|
bin | 1001001101011111110… |
… | …1000110000111100101 |
3 | 120010110011010102222102 |
4 | 2103113331012013211 |
5 | 10043034414034231 |
6 | 200410105541445 |
7 | 14301245203451 |
oct | 2232775060745 |
9 | 503404112872 |
10 | 158241939941 |
11 | 611234a4668 |
12 | 26802aa4885 |
13 | 11bcac723b7 |
14 | 7932237661 |
15 | 41b246aacb |
hex | 24d7f461e5 |
158241939941 has 4 divisors (see below), whose sum is σ = 158488807884. Its totient is φ = 157995072000.
The previous prime is 158241939931. The next prime is 158241939991. The reversal of 158241939941 is 149939142851.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 149939142851 = 83 ⋅1806495697.
It can be written as a sum of positive squares in 2 ways, for example, as 79124064100 + 79117875841 = 281290^2 + 281279^2 .
It is a cyclic number.
It is not a de Polignac number, because 158241939941 - 210 = 158241938917 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (158241939931) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 123433010 + ... + 123434291.
It is an arithmetic number, because the mean of its divisors is an integer number (39622201971).
Almost surely, 2158241939941 is an apocalyptic number.
It is an amenable number.
158241939941 is a deficient number, since it is larger than the sum of its proper divisors (246867943).
158241939941 is an equidigital number, since it uses as much as digits as its factorization.
158241939941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246867942.
The product of its digits is 2799360, while the sum is 56.
The spelling of 158241939941 in words is "one hundred fifty-eight billion, two hundred forty-one million, nine hundred thirty-nine thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •