Base | Representation |
---|---|
bin | 1000000100111011110… |
… | …1101101010011001001 |
3 | 111021011200111000012021 |
4 | 2001032331231103021 |
5 | 4233142010041044 |
6 | 143425220444441 |
7 | 13011460302424 |
oct | 2011675552311 |
9 | 437150430167 |
10 | 138763752649 |
11 | 53938580215 |
12 | 22a87849721 |
13 | 101157190a2 |
14 | 6a053849bb |
15 | 3922425e84 |
hex | 204ef6d4c9 |
138763752649 has 8 divisors (see below), whose sum is σ = 141566548320. Its totient is φ = 135975986016.
The previous prime is 138763752613. The next prime is 138763752653. The reversal of 138763752649 is 946257367831.
It is a happy number.
138763752649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 138763752649 - 27 = 138763752521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (138763752949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3738607 + ... + 3775540.
It is an arithmetic number, because the mean of its divisors is an integer number (17695818540).
Almost surely, 2138763752649 is an apocalyptic number.
It is an amenable number.
138763752649 is a deficient number, since it is larger than the sum of its proper divisors (2802795671).
138763752649 is an equidigital number, since it uses as much as digits as its factorization.
138763752649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7514519.
The product of its digits is 45722880, while the sum is 61.
The spelling of 138763752649 in words is "one hundred thirty-eight billion, seven hundred sixty-three million, seven hundred fifty-two thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •