Base | Representation |
---|---|
bin | 11011010010010000100111… |
… | …111110011111100010101110 |
3 | 120201220002021200021121100210 |
4 | 123102100213332133202232 |
5 | 111212103203034200130 |
6 | 1103120103420203250 |
7 | 34163601561003630 |
oct | 3322204776374256 |
9 | 521802250247323 |
10 | 120002056943790 |
11 | 3526664a77455a |
12 | 11561252099526 |
13 | 51c61b7620b88 |
14 | 218c1b830ca50 |
15 | dd17e00155b0 |
hex | 6d2427f9f8ae |
120002056943790 has 128 divisors (see below), whose sum is σ = 330292469219328. Its totient is φ = 27333749635200.
The previous prime is 120002056943771. The next prime is 120002056943807. The reversal of 120002056943790 is 97349650200021.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 299649867 + ... + 300050073.
It is an arithmetic number, because the mean of its divisors is an integer number (2580409915776).
Almost surely, 2120002056943790 is an apocalyptic number.
120002056943790 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 120002056943790, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165146234609664).
120002056943790 is an abundant number, since it is smaller than the sum of its proper divisors (210290412275538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120002056943790 is a wasteful number, since it uses less digits than its factorization.
120002056943790 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405182.
The product of its (nonzero) digits is 816480, while the sum is 48.
The spelling of 120002056943790 in words is "one hundred twenty trillion, two billion, fifty-six million, nine hundred forty-three thousand, seven hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •