Base | Representation |
---|---|
bin | 1000000100111101011… |
… | …1011011101000000000 |
3 | 111021012011011121100000 |
4 | 2001033113123220000 |
5 | 4233200221333000 |
6 | 143430021200000 |
7 | 13011601516353 |
oct | 2011727335000 |
9 | 437164147300 |
10 | 138770496000 |
11 | 53941366634 |
12 | 22a89b60000 |
13 | 10116c3a536 |
14 | 6a0621c29a |
15 | 3922d09000 |
hex | 204f5dba00 |
138770496000 has 480 divisors, whose sum is σ = 518395445568. Its totient is φ = 37001318400.
The previous prime is 138770495959. The next prime is 138770496037. The reversal of 138770496000 is 694077831.
138770496000 is a `hidden beast` number, since 1 + 38 + 7 + 7 + 0 + 4 + 9 + 600 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (480).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15547539 + ... + 15556461.
Almost surely, 2138770496000 is an apocalyptic number.
138770496000 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 138770496000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (259197722784).
138770496000 is an abundant number, since it is smaller than the sum of its proper divisors (379624949568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138770496000 is an frugal number, since it uses more digits than its factorization.
138770496000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8971 (or 8933 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 45.
The spelling of 138770496000 in words is "one hundred thirty-eight billion, seven hundred seventy million, four hundred ninety-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •