Base | Representation |
---|---|
bin | 11011010100000100000110… |
… | …111000000110011111011000 |
3 | 120202022221100100202122102110 |
4 | 123110010012320012133120 |
5 | 111221121130222444033 |
6 | 1103253051555232320 |
7 | 34205551433544246 |
oct | 3324040670063730 |
9 | 522287310678373 |
10 | 120126055671768 |
11 | 353041a0824143 |
12 | 11581298ba86a0 |
13 | 5204ab90a2973 |
14 | 21941bc757796 |
15 | dd4b4b08e363 |
hex | 6d4106e067d8 |
120126055671768 has 128 divisors (see below), whose sum is σ = 313207704944640. Its totient is φ = 38351777856000.
The previous prime is 120126055671679. The next prime is 120126055671829. The reversal of 120126055671768 is 867176550621021.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25848958 + ... + 30140018.
It is an arithmetic number, because the mean of its divisors is an integer number (2446935194880).
Almost surely, 2120126055671768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120126055671768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156603852472320).
120126055671768 is an abundant number, since it is smaller than the sum of its proper divisors (193081649272872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120126055671768 is a wasteful number, since it uses less digits than its factorization.
120126055671768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4291489 (or 4291485 counting only the distinct ones).
The product of its (nonzero) digits is 8467200, while the sum is 57.
The spelling of 120126055671768 in words is "one hundred twenty trillion, one hundred twenty-six billion, fifty-five million, six hundred seventy-one thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •