Base | Representation |
---|---|
bin | 1000001001001101001… |
… | …0100100101111111000 |
3 | 111101010120111010120000 |
4 | 2002103102210233320 |
5 | 4243013434321321 |
6 | 144135050233000 |
7 | 13052050000305 |
oct | 2022322445770 |
9 | 441116433500 |
10 | 139910073336 |
11 | 54376652990 |
12 | 23147725760 |
13 | 10269067557 |
14 | 6ab37000ac |
15 | 398cdab826 |
hex | 20934a4bf8 |
139910073336 has 160 divisors (see below), whose sum is σ = 429424934400. Its totient is φ = 42206391360.
The previous prime is 139910073319. The next prime is 139910073379. The reversal of 139910073336 is 633370019931.
It is a junction number, because it is equal to n+sod(n) for n = 139910073291 and 139910073300.
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 39 ways as a sum of consecutive naturals, for example, 1545535 + ... + 1633553.
It is an arithmetic number, because the mean of its divisors is an integer number (2683905840).
Almost surely, 2139910073336 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 139910073336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214712467200).
139910073336 is an abundant number, since it is smaller than the sum of its proper divisors (289514861064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139910073336 is a wasteful number, since it uses less digits than its factorization.
139910073336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88271 (or 88258 counting only the distinct ones).
The product of its (nonzero) digits is 275562, while the sum is 45.
The spelling of 139910073336 in words is "one hundred thirty-nine billion, nine hundred ten million, seventy-three thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •