Base | Representation |
---|---|
bin | 1000000100100000001… |
… | …0110101000000000000 |
3 | 111020212121000121100010 |
4 | 2001020002311000000 |
5 | 4232422244420100 |
6 | 143405512224520 |
7 | 13005550421523 |
oct | 2011002650000 |
9 | 436777017303 |
10 | 138647654400 |
11 | 53888a93952 |
12 | 22a5499b140 |
13 | 100c765a0b8 |
14 | 69d3ba2bba |
15 | 3917141750 |
hex | 20480b5000 |
138647654400 has 624 divisors, whose sum is σ = 482653036800. Its totient is φ = 35067002880.
The previous prime is 138647654399. The next prime is 138647654417. The reversal of 138647654400 is 4456746831.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 138647654400.
It is a congruent number.
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, 703795102 + ... + 703795298.
Almost surely, 2138647654400 is an apocalyptic number.
138647654400 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 138647654400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (241326518400).
138647654400 is an abundant number, since it is smaller than the sum of its proper divisors (344005382400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138647654400 is a wasteful number, since it uses less digits than its factorization.
138647654400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 342 (or 315 counting only the distinct ones).
The product of its (nonzero) digits is 1935360, while the sum is 48.
The spelling of 138647654400 in words is "one hundred thirty-eight billion, six hundred forty-seven million, six hundred fifty-four thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •