Base | Representation |
---|---|
bin | 11011010101100101001101… |
… | …101101100101001000010001 |
3 | 120202200220110221201112021221 |
4 | 123111211031231211020101 |
5 | 111224323200231423441 |
6 | 1103413014212445041 |
7 | 34216232331056062 |
oct | 3325451555451021 |
9 | 522626427645257 |
10 | 120230323311121 |
11 | 35344437124911 |
12 | 11599538019781 |
13 | 5211894ab129a |
14 | 21992704ba569 |
15 | dd76eecb98d1 |
hex | 6d594db65211 |
120230323311121 has 32 divisors (see below), whose sum is σ = 125677777305600. Its totient is φ = 114929553818880.
The previous prime is 120230323311061. The next prime is 120230323311149. The reversal of 120230323311121 is 121113323032021.
It is a cyclic number.
It is not a de Polignac number, because 120230323311121 - 29 = 120230323310609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120230323311151) 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 31 ways as a sum of consecutive naturals, for example, 1396181856 + ... + 1396267966.
It is an arithmetic number, because the mean of its divisors is an integer number (3927430540800).
Almost surely, 2120230323311121 is an apocalyptic number.
It is an amenable number.
120230323311121 is a deficient number, since it is larger than the sum of its proper divisors (5447453994479).
120230323311121 is a wasteful number, since it uses less digits than its factorization.
120230323311121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89469.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 120230323311121 its reverse (121113323032021), we get a palindrome (241343646343142).
The spelling of 120230323311121 in words is "one hundred twenty trillion, two hundred thirty billion, three hundred twenty-three million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •