Base | Representation |
---|---|
bin | 1000000110001010001… |
… | …1110110101100110100 |
3 | 111022000121010002211220 |
4 | 2001202203312230310 |
5 | 4234330141112412 |
6 | 143522003230340 |
7 | 13022561624145 |
oct | 2014243665464 |
9 | 438017102756 |
10 | 139092519732 |
11 | 53a97112851 |
12 | 22b599783b0 |
13 | 1016887991a |
14 | 6a36cc5acc |
15 | 394121868c |
hex | 20628f6b34 |
139092519732 has 24 divisors (see below), whose sum is σ = 325942134336. Its totient is φ = 46165184448.
The previous prime is 139092519667. The next prime is 139092519733. The reversal of 139092519732 is 237915290931.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139092519733) 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, 24870688 + ... + 24876279.
It is an arithmetic number, because the mean of its divisors is an integer number (13580922264).
Almost surely, 2139092519732 is an apocalyptic number.
139092519732 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
139092519732 is an abundant number, since it is smaller than the sum of its proper divisors (186849614604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139092519732 is a wasteful number, since it uses less digits than its factorization.
139092519732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49747207 (or 49747205 counting only the distinct ones).
The product of its (nonzero) digits is 918540, while the sum is 51.
The spelling of 139092519732 in words is "one hundred thirty-nine billion, ninety-two million, five hundred nineteen thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •