Base | Representation |
---|---|
bin | 11011010011110111000010… |
… | …111000100010000111001011 |
3 | 120202021121010220001100011011 |
4 | 123103313002320202013023 |
5 | 111220403414142013311 |
6 | 1103242412125144351 |
7 | 34204544034561211 |
oct | 3323670270420713 |
9 | 522247126040134 |
10 | 120112030032331 |
11 | 352a9253703697 |
12 | 1157a6239bb0b7 |
13 | 520369238782c |
14 | 219364bac8cb1 |
15 | dd45c9a94321 |
hex | 6d3dc2e221cb |
120112030032331 has 4 divisors (see below), whose sum is σ = 120119449409200. Its totient is φ = 120104610655464.
The previous prime is 120112030032329. The next prime is 120112030032343. The reversal of 120112030032331 is 133230030211021.
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 120112030032331 - 21 = 120112030032329 is a prime.
It is a super-2 number, since 2×1201120300323312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120112030032311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3709664151 + ... + 3709696528.
It is an arithmetic number, because the mean of its divisors is an integer number (30029862352300).
Almost surely, 2120112030032331 is an apocalyptic number.
120112030032331 is a deficient number, since it is larger than the sum of its proper divisors (7419376869).
120112030032331 is an equidigital number, since it uses as much as digits as its factorization.
120112030032331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7419376868.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 120112030032331 its reverse (133230030211021), we get a palindrome (253342060243352).
The spelling of 120112030032331 in words is "one hundred twenty trillion, one hundred twelve billion, thirty million, thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.894 sec. • engine limits •