Base | Representation |
---|---|
bin | 111010110110010100… |
… | …0110011001001111000 |
3 | 110002012102000211111102 |
4 | 1311230220303021320 |
5 | 4032304412424300 |
6 | 134020122550532 |
7 | 12062506052162 |
oct | 1655450631170 |
9 | 402172024442 |
10 | 126376686200 |
11 | 49661387916 |
12 | 205ab368448 |
13 | bbc0320b7b |
14 | 618c1ab932 |
15 | 3449be90d5 |
hex | 1d6ca33278 |
126376686200 has 96 divisors (see below), whose sum is σ = 301773654000. Its totient is φ = 49189708800.
The previous prime is 126376686193. The next prime is 126376686209. The reversal of 126376686200 is 2686673621.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126376686209) 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 23 ways as a sum of consecutive naturals, for example, 3169991 + ... + 3209609.
Almost surely, 2126376686200 is an apocalyptic number.
126376686200 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 126376686200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150886827000).
126376686200 is an abundant number, since it is smaller than the sum of its proper divisors (175396967800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126376686200 is a wasteful number, since it uses less digits than its factorization.
126376686200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40065 (or 40056 counting only the distinct ones).
The product of its (nonzero) digits is 870912, while the sum is 47.
The spelling of 126376686200 in words is "one hundred twenty-six billion, three hundred seventy-six million, six hundred eighty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •