Base | Representation |
---|---|
bin | 1000000100111101000… |
… | …1000010010010110000 |
3 | 111021012001000102102211 |
4 | 2001033101002102300 |
5 | 4233144304210001 |
6 | 143425521221504 |
7 | 13011551334265 |
oct | 2011721022260 |
9 | 437161012384 |
10 | 138768819376 |
11 | 539404209a0 |
12 | 22a89491894 |
13 | 101167a1355 |
14 | 6a05d0326c |
15 | 3922ac7351 |
hex | 204f4424b0 |
138768819376 has 80 divisors (see below), whose sum is σ = 311541979680. Its totient is φ = 59178659840.
The previous prime is 138768819361. The next prime is 138768819389. The reversal of 138768819376 is 673918867831.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 875310 + ... + 1021618.
It is an arithmetic number, because the mean of its divisors is an integer number (3894274746).
Almost surely, 2138768819376 is an apocalyptic number.
138768819376 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 138768819376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155770989840).
138768819376 is an abundant number, since it is smaller than the sum of its proper divisors (172773160304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138768819376 is a wasteful number, since it uses less digits than its factorization.
138768819376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146662 (or 146656 counting only the distinct ones).
The product of its digits is 73156608, while the sum is 67.
The spelling of 138768819376 in words is "one hundred thirty-eight billion, seven hundred sixty-eight million, eight hundred nineteen thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •