Base | Representation |
---|---|
bin | 1000000101111110110… |
… | …1011110101111000111 |
3 | 111021220021011012002201 |
4 | 2001133231132233013 |
5 | 4234230421230432 |
6 | 143513134415331 |
7 | 13021441355152 |
oct | 2013755365707 |
9 | 437807135081 |
10 | 139044711367 |
11 | 53a72129701 |
12 | 22b45961547 |
13 | 1015b9aac53 |
14 | 6a307dcc99 |
15 | 393be22ee7 |
hex | 205fb5ebc7 |
139044711367 has 8 divisors (see below), whose sum is σ = 139808156400. Its totient is φ = 138281710080.
The previous prime is 139044711347. The next prime is 139044711371. The reversal of 139044711367 is 763117440931.
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-139044711367 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 (139044711347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 527517 + ... + 745897.
It is an arithmetic number, because the mean of its divisors is an integer number (17476019550).
Almost surely, 2139044711367 is an apocalyptic number.
139044711367 is a deficient number, since it is larger than the sum of its proper divisors (763445033).
139044711367 is a wasteful number, since it uses less digits than its factorization.
139044711367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221873.
The product of its (nonzero) digits is 381024, while the sum is 46.
The spelling of 139044711367 in words is "one hundred thirty-nine billion, forty-four million, seven hundred eleven thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •