Base | Representation |
---|---|
bin | 1000000011011111001… |
… | …1110101001011001100 |
3 | 111020011121111221012011 |
4 | 2000313303311023030 |
5 | 4231343033200000 |
6 | 143322502351004 |
7 | 12666032352112 |
oct | 2006763651314 |
9 | 436147457164 |
10 | 138375287500 |
11 | 5375927363a |
12 | 2299972b464 |
13 | 100830b5b58 |
14 | 69a9943ab2 |
15 | 38ed2902ba |
hex | 2037cf52cc |
138375287500 has 36 divisors (see below), whose sum is σ = 302676596208. Its totient is φ = 55350110000.
The previous prime is 138375287489. The next prime is 138375287509. The reversal of 138375287500 is 5782573831.
138375287500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (138375287509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5522512 + ... + 5547511.
It is an arithmetic number, because the mean of its divisors is an integer number (8407683228).
Almost surely, 2138375287500 is an apocalyptic number.
138375287500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
138375287500 is an abundant number, since it is smaller than the sum of its proper divisors (164301308708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138375287500 is an equidigital number, since it uses as much as digits as its factorization.
138375287500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11070052 (or 11070030 counting only the distinct ones).
The product of its (nonzero) digits is 1411200, while the sum is 49.
The spelling of 138375287500 in words is "one hundred thirty-eight billion, three hundred seventy-five million, two hundred eighty-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •