Base | Representation |
---|---|
bin | 1000000101110110111… |
… | …0010011011110100111 |
3 | 111021210221102102102011 |
4 | 2001131232103132213 |
5 | 4234143402413332 |
6 | 143505544055051 |
7 | 13020555113515 |
oct | 2013556233647 |
9 | 437727372364 |
10 | 139011372967 |
11 | 53a55329005 |
12 | 22b36764487 |
13 | 10154b0759c |
14 | 6a2a2014b5 |
15 | 3939039e47 |
hex | 205db937a7 |
139011372967 has 4 divisors (see below), whose sum is σ = 139864203640. Its totient is φ = 138158542296.
The previous prime is 139011372953. The next prime is 139011373027. The reversal of 139011372967 is 769273110931.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 139011372967 - 231 = 136863889319 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 139011372967.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139011372067) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 426415092 + ... + 426415417.
It is an arithmetic number, because the mean of its divisors is an integer number (34966050910).
Almost surely, 2139011372967 is an apocalyptic number.
139011372967 is a deficient number, since it is larger than the sum of its proper divisors (852830673).
139011372967 is an equidigital number, since it uses as much as digits as its factorization.
139011372967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 852830672.
The product of its (nonzero) digits is 428652, while the sum is 49.
The spelling of 139011372967 in words is "one hundred thirty-nine billion, eleven million, three hundred seventy-two thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •