Base | Representation |
---|---|
bin | 11111011101001011100111… |
… | …111010100110000110001111 |
3 | 200010211122002002220112020102 |
4 | 133131023213322212012033 |
5 | 121113120111100021310 |
6 | 1210122415030441315 |
7 | 41066036542140353 |
oct | 3735134772460617 |
9 | 603748062815212 |
10 | 138344787501455 |
11 | 400987709a3477 |
12 | 1362419150323b |
13 | 5c26b1bb76ba2 |
14 | 2623ccdcd5463 |
15 | 10ed9eab338a5 |
hex | 7dd2e7ea618f |
138344787501455 has 8 divisors (see below), whose sum is σ = 167113173777504. Its totient is φ = 109942877484000.
The previous prime is 138344787501449. The next prime is 138344787501493. The reversal of 138344787501455 is 554105787443831.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 138344787501455 - 218 = 138344787239311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 138344787501391 and 138344787501400.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91619063816 + ... + 91619065325.
It is an arithmetic number, because the mean of its divisors is an integer number (20889146722188).
Almost surely, 2138344787501455 is an apocalyptic number.
138344787501455 is a deficient number, since it is larger than the sum of its proper divisors (28768386276049).
138344787501455 is a wasteful number, since it uses less digits than its factorization.
138344787501455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183238129297.
The product of its (nonzero) digits is 225792000, while the sum is 65.
The spelling of 138344787501455 in words is "one hundred thirty-eight trillion, three hundred forty-four billion, seven hundred eighty-seven million, five hundred one thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •