Base | Representation |
---|---|
bin | 11111011111111010010010… |
… | …100101110001010110000001 |
3 | 200011111120011120202020022011 |
4 | 133133322102211301112001 |
5 | 121124203210120241121 |
6 | 1210344513110412521 |
7 | 41115426251515642 |
oct | 3737722245612601 |
9 | 604446146666264 |
10 | 138532334540161 |
11 | 40160262354521 |
12 | 136545b2661141 |
13 | 5c3b70a2389c3 |
14 | 262d0021696c9 |
15 | 1103825bb17e1 |
hex | 7dfe92971581 |
138532334540161 has 8 divisors (see below), whose sum is σ = 149540151228480. Its totient is φ = 127939907160912.
The previous prime is 138532334540153. The next prime is 138532334540179. The reversal of 138532334540161 is 161045433235831.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 138532334540161 - 23 = 138532334540153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (138532334540111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103847326575 + ... + 103847327908.
It is an arithmetic number, because the mean of its divisors is an integer number (18692518903560).
Almost surely, 2138532334540161 is an apocalyptic number.
It is an amenable number.
138532334540161 is a deficient number, since it is larger than the sum of its proper divisors (11007816688319).
138532334540161 is a wasteful number, since it uses less digits than its factorization.
138532334540161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207694654535.
The product of its (nonzero) digits is 3110400, while the sum is 49.
Adding to 138532334540161 its reverse (161045433235831), we get a palindrome (299577767775992).
The spelling of 138532334540161 in words is "one hundred thirty-eight trillion, five hundred thirty-two billion, three hundred thirty-four million, five hundred forty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •