Base | Representation |
---|---|
bin | 11011010110111011101110… |
… | …111011001001000001100011 |
3 | 120210000210021020120200122120 |
4 | 123112323232323021001203 |
5 | 111232333424402423021 |
6 | 1103523420352435323 |
7 | 34226031421406256 |
oct | 3326735673110143 |
9 | 523023236520576 |
10 | 120323222311011 |
11 | 3537a8791a1485 |
12 | 115b3543848b43 |
13 | 521a57b3b3cc5 |
14 | 219d96440d09d |
15 | dd9d3a8d92c6 |
hex | 6d6eeeec9063 |
120323222311011 has 8 divisors (see below), whose sum is σ = 161493419791104. Its totient is φ = 79684253185800.
The previous prime is 120323222310979. The next prime is 120323222311021. The reversal of 120323222311011 is 110113222323021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120323222311011 - 25 = 120323222310979 is a prime.
It is a super-2 number, since 2×1203232223110112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (120323222311021) 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, 132807088191 + ... + 132807089096.
It is an arithmetic number, because the mean of its divisors is an integer number (20186677473888).
Almost surely, 2120323222311011 is an apocalyptic number.
120323222311011 is a deficient number, since it is larger than the sum of its proper divisors (41170197480093).
120323222311011 is a wasteful number, since it uses less digits than its factorization.
120323222311011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265614177441.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 120323222311011 its reverse (110113222323021), we get a palindrome (230436444634032).
The spelling of 120323222311011 in words is "one hundred twenty trillion, three hundred twenty-three billion, two hundred twenty-two million, three hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •