Base | Representation |
---|---|
bin | 1000000111000001011… |
… | …1111100000011010110 |
3 | 111022121202012120222120 |
4 | 2001300113330003112 |
5 | 4240314003330300 |
6 | 144001002440410 |
7 | 13031404546155 |
oct | 2016027740326 |
9 | 438552176876 |
10 | 139324276950 |
11 | 540a5a16441 |
12 | 23003503106 |
13 | 101a48a2981 |
14 | 6a599b359c |
15 | 39567473a0 |
hex | 20705fc0d6 |
139324276950 has 24 divisors (see below), whose sum is σ = 345524207208. Its totient is φ = 37153140480.
The previous prime is 139324276907. The next prime is 139324276967. The reversal of 139324276950 is 59672423931.
It is a super-2 number, since 2×1393242769502 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 139324276893 and 139324276902.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 464414107 + ... + 464414406.
It is an arithmetic number, because the mean of its divisors is an integer number (14396841967).
Almost surely, 2139324276950 is an apocalyptic number.
139324276950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
139324276950 is an abundant number, since it is smaller than the sum of its proper divisors (206199930258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139324276950 is a wasteful number, since it uses less digits than its factorization.
139324276950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 928828528 (or 928828523 counting only the distinct ones).
The product of its (nonzero) digits is 2449440, while the sum is 51.
The spelling of 139324276950 in words is "one hundred thirty-nine billion, three hundred twenty-four million, two hundred seventy-six thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •