Base | Representation |
---|---|
bin | 11011011001110011000011… |
… | …000000011100110111101011 |
3 | 120210201121022210010120001121 |
4 | 123121303003000130313223 |
5 | 111244100032311014011 |
6 | 1104154052023000111 |
7 | 34246200201231241 |
oct | 3331630300346753 |
9 | 523647283116047 |
10 | 120520054001131 |
11 | 354462a4594564 |
12 | 11625716299037 |
13 | 5232cb91ab9b5 |
14 | 21a92b77d4791 |
15 | de000ab1ee71 |
hex | 6d9cc301cdeb |
120520054001131 has 4 divisors (see below), whose sum is σ = 127609468942392. Its totient is φ = 113430639059872.
The previous prime is 120520054001129. The next prime is 120520054001201. The reversal of 120520054001131 is 131100450025021.
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 120520054001131 - 21 = 120520054001129 is a prime.
It is a super-2 number, since 2×1205200540011312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120520054001096 and 120520054001105.
It is not an unprimeable number, because it can be changed into a prime (120520054001101) 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, 3544707470605 + ... + 3544707470638.
It is an arithmetic number, because the mean of its divisors is an integer number (31902367235598).
Almost surely, 2120520054001131 is an apocalyptic number.
120520054001131 is a deficient number, since it is larger than the sum of its proper divisors (7089414941261).
120520054001131 is an equidigital number, since it uses as much as digits as its factorization.
120520054001131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7089414941260.
The product of its (nonzero) digits is 1200, while the sum is 25.
The spelling of 120520054001131 in words is "one hundred twenty trillion, five hundred twenty billion, fifty-four million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •