Base | Representation |
---|---|
bin | 11011010100001001101010… |
… | …111110110110110000010101 |
3 | 120202100111202201202122001111 |
4 | 123110021222332312300111 |
5 | 111221220344203144341 |
6 | 1103255520500455021 |
7 | 34206152460606343 |
oct | 3324115276666025 |
9 | 522314681678044 |
10 | 120132030131221 |
11 | 3530678719aa39 |
12 | 115824859aa471 |
13 | 520552ba98484 |
14 | 21945c7dd8993 |
15 | dd4d9a82e681 |
hex | 6d426afb6c15 |
120132030131221 has 16 divisors (see below), whose sum is σ = 128833167398400. Its totient is φ = 111675785680368.
The previous prime is 120132030131177. The next prime is 120132030131233. The reversal of 120132030131221 is 122131030231021.
It is a cyclic number.
It is not a de Polignac number, because 120132030131221 - 29 = 120132030130709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120132030131192 and 120132030131201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120132030131261) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 97343905 + ... + 98570278.
It is an arithmetic number, because the mean of its divisors is an integer number (8052072962400).
Almost surely, 2120132030131221 is an apocalyptic number.
It is an amenable number.
120132030131221 is a deficient number, since it is larger than the sum of its proper divisors (8701137267179).
120132030131221 is a wasteful number, since it uses less digits than its factorization.
120132030131221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195914808.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 120132030131221 its reverse (122131030231021), we get a palindrome (242263060362242).
The spelling of 120132030131221 in words is "one hundred twenty trillion, one hundred thirty-two billion, thirty million, one hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •