Base | Representation |
---|---|
bin | 11011010010101000000110… |
… | …010100110010011101100000 |
3 | 120201222111100021100121022220 |
4 | 123102220012110302131200 |
5 | 111213011313103320010 |
6 | 1103135432451431040 |
7 | 34165453306605225 |
oct | 3322500624623540 |
9 | 521874307317286 |
10 | 120027262166880 |
11 | 35276304430742 |
12 | 115661072b5480 |
13 | 51c86a351cb73 |
14 | 218d4c9a3794c |
15 | dd22b7c24970 |
hex | 6d2a06532760 |
120027262166880 has 96 divisors (see below), whose sum is σ = 378320860159200. Its totient is φ = 31987377057792.
The previous prime is 120027262166843. The next prime is 120027262166881. The reversal of 120027262166880 is 88661262720021.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120027262166881) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76933335 + ... + 78477974.
It is an arithmetic number, because the mean of its divisors is an integer number (3940842293325).
Almost surely, 2120027262166880 is an apocalyptic number.
120027262166880 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120027262166880 is an abundant number, since it is smaller than the sum of its proper divisors (258293597992320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120027262166880 is a wasteful number, since it uses less digits than its factorization.
120027262166880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155412936 (or 155412928 counting only the distinct ones).
The product of its (nonzero) digits is 1548288, while the sum is 51.
The spelling of 120027262166880 in words is "one hundred twenty trillion, twenty-seven billion, two hundred sixty-two million, one hundred sixty-six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •