Base | Representation |
---|---|
bin | 11011010100001000111011… |
… | …011010010011101000010011 |
3 | 120202100102201002222102200002 |
4 | 123110020323122103220103 |
5 | 111221212230344133021 |
6 | 1103255305350320215 |
7 | 34206123630023411 |
oct | 3324107332235023 |
9 | 522312632872602 |
10 | 120131232021011 |
11 | 3530640772aa22 |
12 | 115822a265906b |
13 | 5205432627803 |
14 | 21945500022b1 |
15 | dd4d5072c50b |
hex | 6d423b693a13 |
120131232021011 has 4 divisors (see below), whose sum is σ = 121578596262312. Its totient is φ = 118683867779712.
The previous prime is 120131232021007. The next prime is 120131232021083. The reversal of 120131232021011 is 110120232131021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120131232021011 - 22 = 120131232021007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120131232621011) 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 3 ways as a sum of consecutive naturals, for example, 723682120526 + ... + 723682120691.
It is an arithmetic number, because the mean of its divisors is an integer number (30394649065578).
Almost surely, 2120131232021011 is an apocalyptic number.
120131232021011 is a deficient number, since it is larger than the sum of its proper divisors (1447364241301).
120131232021011 is an equidigital number, since it uses as much as digits as its factorization.
120131232021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1447364241300.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 120131232021011 its reverse (110120232131021), we get a palindrome (230251464152032).
The spelling of 120131232021011 in words is "one hundred twenty trillion, one hundred thirty-one billion, two hundred thirty-two million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •