Base | Representation |
---|---|
bin | 1000000010001110010… |
… | …0000111110000000000 |
3 | 111012021221101021210002 |
4 | 2000203210013300000 |
5 | 4230144104444320 |
6 | 143225050255132 |
7 | 12654436311242 |
oct | 2004344076000 |
9 | 435257337702 |
10 | 138035624960 |
11 | 535a456a0a2 |
12 | 22903a274a8 |
13 | 1002a90bcbc |
14 | 69767a8092 |
15 | 38cd549675 |
hex | 2023907c00 |
138035624960 has 176 divisors, whose sum is σ = 342747387360. Its totient is φ = 53304360960.
The previous prime is 138035624941. The next prime is 138035624963. The reversal of 138035624960 is 69426530831.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138035624963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20358851 + ... + 20365629.
Almost surely, 2138035624960 is an apocalyptic number.
138035624960 is a gapful number since it is divisible by the number (10) 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 138035624960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171373693680).
138035624960 is an abundant number, since it is smaller than the sum of its proper divisors (204711762400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138035624960 is an equidigital number, since it uses as much as digits as its factorization.
138035624960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6942 (or 6924 counting only the distinct ones).
The product of its (nonzero) digits is 933120, while the sum is 47.
The spelling of 138035624960 in words is "one hundred thirty-eight billion, thirty-five million, six hundred twenty-four thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •