Base | Representation |
---|---|
bin | 11111011000100011111000… |
… | …000001101001000011010101 |
3 | 200002201021101222211101100112 |
4 | 133120203320001221003111 |
5 | 121042414231413012432 |
6 | 1205320500103452405 |
7 | 41034065302510142 |
oct | 3730437001510325 |
9 | 602637358741315 |
10 | 138027230204117 |
11 | 3aa860240a6891 |
12 | 13592728157105 |
13 | 5c02bb175b057 |
14 | 26127a70853c9 |
15 | 10e5611db77b2 |
hex | 7d88f80690d5 |
138027230204117 has 8 divisors (see below), whose sum is σ = 145511204938752. Its totient is φ = 130732723184400.
The previous prime is 138027230204113. The next prime is 138027230204159. The reversal of 138027230204117 is 711402032720831.
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 138027230204117 - 22 = 138027230204113 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138027230204113) 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, 47366927234 + ... + 47366930147.
It is an arithmetic number, because the mean of its divisors is an integer number (18188900617344).
Almost surely, 2138027230204117 is an apocalyptic number.
It is an amenable number.
138027230204117 is a deficient number, since it is larger than the sum of its proper divisors (7483974734635).
138027230204117 is an equidigital number, since it uses as much as digits as its factorization.
138027230204117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94733857459.
The product of its (nonzero) digits is 112896, while the sum is 41.
Adding to 138027230204117 its reverse (711402032720831), we get a palindrome (849429262924948).
The spelling of 138027230204117 in words is "one hundred thirty-eight trillion, twenty-seven billion, two hundred thirty million, two hundred four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •