Base | Representation |
---|---|
bin | 1000000101110000011… |
… | …0110111101000010011 |
3 | 111021202001101211202121 |
4 | 2001130012313220103 |
5 | 4234114432224232 |
6 | 143503134555111 |
7 | 13020105462364 |
oct | 2013406675023 |
9 | 437661354677 |
10 | 138984258067 |
11 | 53a40a991a6 |
12 | 22b29668a97 |
13 | 1014c302875 |
14 | 6a26783b6b |
15 | 3936980d97 |
hex | 205c1b7a13 |
138984258067 has 8 divisors (see below), whose sum is σ = 150027985440. Its totient is φ = 128357275200.
The previous prime is 138984258029. The next prime is 138984258103. The reversal of 138984258067 is 760852489831.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-138984258067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 138984257996 and 138984258014.
It is not an unprimeable number, because it can be changed into a prime (138984258167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104185434 + ... + 104186767.
It is an arithmetic number, because the mean of its divisors is an integer number (18753498180).
It is a 1-persistent number, because it is pandigital, but 2⋅138984258067 = 277968516134 is not.
Almost surely, 2138984258067 is an apocalyptic number.
138984258067 is a deficient number, since it is larger than the sum of its proper divisors (11043727373).
138984258067 is a wasteful number, since it uses less digits than its factorization.
138984258067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208372253.
The product of its (nonzero) digits is 23224320, while the sum is 61.
The spelling of 138984258067 in words is "one hundred thirty-eight billion, nine hundred eighty-four million, two hundred fifty-eight thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •