Base | Representation |
---|---|
bin | 1000000100111110011… |
… | …1001101010010110000 |
3 | 111021012102221201022101 |
4 | 2001033213031102300 |
5 | 4233202301202400 |
6 | 143430245550144 |
7 | 13011651622453 |
oct | 2011747152260 |
9 | 437172851271 |
10 | 138774631600 |
11 | 53943730790 |
12 | 22a8b415354 |
13 | 10117a57a37 |
14 | 6a069b749a |
15 | 392337456a |
hex | 204f9cd4b0 |
138774631600 has 120 divisors (see below), whose sum is σ = 369881058240. Its totient is φ = 49608096000.
The previous prime is 138774631573. The next prime is 138774631649. The reversal of 138774631600 is 6136477831.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7686 + ... + 526885.
It is an arithmetic number, because the mean of its divisors is an integer number (3082342152).
Almost surely, 2138774631600 is an apocalyptic number.
138774631600 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 138774631600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184940529120).
138774631600 is an abundant number, since it is smaller than the sum of its proper divisors (231106426640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138774631600 is a wasteful number, since it uses less digits than its factorization.
138774631600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534659 (or 534648 counting only the distinct ones).
The product of its (nonzero) digits is 508032, while the sum is 46.
The spelling of 138774631600 in words is "one hundred thirty-eight billion, seven hundred seventy-four million, six hundred thirty-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •