Base | Representation |
---|---|
bin | 11111100101000110001111… |
… | …110011011011001101101011 |
3 | 200012202122012012002101200221 |
4 | 133211012033303123031223 |
5 | 121201023200114322301 |
6 | 1211220341541110511 |
7 | 41153245124536636 |
oct | 3745061763331553 |
9 | 605678165071627 |
10 | 138888770073451 |
11 | 4028843a97a222 |
12 | 136b16a80b8437 |
13 | 5c662021a6098 |
14 | 26423765c0c1d |
15 | 110cc37bceda1 |
hex | 7e518fcdb36b |
138888770073451 has 8 divisors (see below), whose sum is σ = 142206415040624. Its totient is φ = 135575110268640.
The previous prime is 138888770073413. The next prime is 138888770073457. The reversal of 138888770073451 is 154370077888831.
It is a happy number.
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 138888770073451 - 29 = 138888770072939 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (138888770073457) by changing a digit.
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, 996220056 + ... + 996359461.
It is an arithmetic number, because the mean of its divisors is an integer number (17775801880078).
Almost surely, 2138888770073451 is an apocalyptic number.
138888770073451 is a deficient number, since it is larger than the sum of its proper divisors (3317644967173).
138888770073451 is a wasteful number, since it uses less digits than its factorization.
138888770073451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1992581181.
The product of its (nonzero) digits is 252887040, while the sum is 70.
The spelling of 138888770073451 in words is "one hundred thirty-eight trillion, eight hundred eighty-eight billion, seven hundred seventy million, seventy-three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •