Base | Representation |
---|---|
bin | 111011000100011000… |
… | …0101010011100000000 |
3 | 110010102021211221122201 |
4 | 1312020300222130000 |
5 | 4034241204302241 |
6 | 134135015442544 |
7 | 12110265353656 |
oct | 1661060523400 |
9 | 403367757581 |
10 | 126848509696 |
11 | 49883749897 |
12 | 20701386454 |
13 | bc66cbbc7c |
14 | 61d4b0add6 |
15 | 3476348931 |
hex | 1d88c2a700 |
126848509696 has 72 divisors (see below), whose sum is σ = 254540464640. Its totient is φ = 63089777664.
The previous prime is 126848509673. The next prime is 126848509699. The reversal of 126848509696 is 696905848621.
It is a Harshad number since it is a multiple of its sum of digits (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126848509699) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47704015 + ... + 47706673.
Almost surely, 2126848509696 is an apocalyptic number.
126848509696 is a gapful number since it is divisible by the number (16) 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 126848509696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127270232320).
126848509696 is an abundant number, since it is smaller than the sum of its proper divisors (127691954944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126848509696 is an equidigital number, since it uses as much as digits as its factorization.
126848509696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3589 (or 3575 counting only the distinct ones).
The product of its (nonzero) digits is 44789760, while the sum is 64.
The spelling of 126848509696 in words is "one hundred twenty-six billion, eight hundred forty-eight million, five hundred nine thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •