Base | Representation |
---|---|
bin | 11011010010101000000110… |
… | …010100110010101111001011 |
3 | 120201222111100021100122212210 |
4 | 123102220012110302233023 |
5 | 111213011313103334021 |
6 | 1103135432451440203 |
7 | 34165453306611432 |
oct | 3322500624625713 |
9 | 521874307318783 |
10 | 120027262168011 |
11 | 35276304431580 |
12 | 115661072b6063 |
13 | 51c86a3520533 |
14 | 218d4c9a38119 |
15 | dd22b7c24e76 |
hex | 6d2a06532bcb |
120027262168011 has 64 divisors (see below), whose sum is σ = 177978456576000. Its totient is φ = 71336048112000.
The previous prime is 120027262167991. The next prime is 120027262168019. The reversal of 120027262168011 is 110861262720021.
It is not a de Polignac number, because 120027262168011 - 26 = 120027262167947 is a prime.
It is a super-2 number, since 2×1200272621680112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (120027262168019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2559138661 + ... + 2559185561.
It is an arithmetic number, because the mean of its divisors is an integer number (2780913384000).
Almost surely, 2120027262168011 is an apocalyptic number.
120027262168011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120027262168011 is a deficient number, since it is larger than the sum of its proper divisors (57951194407989).
120027262168011 is a wasteful number, since it uses less digits than its factorization.
120027262168011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50160.
The product of its (nonzero) digits is 32256, while the sum is 39.
The spelling of 120027262168011 in words is "one hundred twenty trillion, twenty-seven billion, two hundred sixty-two million, one hundred sixty-eight thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •