Base | Representation |
---|---|
bin | 111011000000010110… |
… | …0001000011100000000 |
3 | 110010001212001122010200 |
4 | 1312000230020130000 |
5 | 4034002023313003 |
6 | 134113341325200 |
7 | 12104032420362 |
oct | 1660054103400 |
9 | 403055048120 |
10 | 126713104128 |
11 | 49814275666 |
12 | 20683b66800 |
13 | bc44c2cc30 |
14 | 61c0b40d32 |
15 | 34694ed6a3 |
hex | 1d80b08700 |
126713104128 has 432 divisors, whose sum is σ = 408554065920. Its totient is φ = 37507276800.
The previous prime is 126713104099. The next prime is 126713104139. The reversal of 126713104128 is 821401317621.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 126713104092 and 126713104101.
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, 221914083 + ... + 221914653.
Almost surely, 2126713104128 is an apocalyptic number.
126713104128 is a gapful number since it is divisible by the number (18) 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 126713104128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (204277032960).
126713104128 is an abundant number, since it is smaller than the sum of its proper divisors (281840961792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126713104128 is a wasteful number, since it uses less digits than its factorization.
126713104128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 876 (or 859 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 36.
The spelling of 126713104128 in words is "one hundred twenty-six billion, seven hundred thirteen million, one hundred four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •