Base | Representation |
---|---|
bin | 11011010101010010010011… |
… | …001000010011111101110011 |
3 | 120202121222001111111102021122 |
4 | 123111102103020103331303 |
5 | 111224010101324011011 |
6 | 1103355415002412455 |
7 | 34214613121155110 |
oct | 3325222310237563 |
9 | 522558044442248 |
10 | 120210013110131 |
11 | 3533686459423a |
12 | 1159560a20112b |
13 | 520c9a9076689 |
14 | 21982a4d27907 |
15 | dd6e11bc73db |
hex | 6d5493213f73 |
120210013110131 has 4 divisors (see below), whose sum is σ = 137382872125872. Its totient is φ = 103037154094392.
The previous prime is 120210013110119. The next prime is 120210013110157. The reversal of 120210013110131 is 131011310012021.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 120210013110131 - 246 = 49841268932467 is a prime.
It is a super-2 number, since 2×1202100131101312 (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 (120210013110101) 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, 8586429507860 + ... + 8586429507873.
It is an arithmetic number, because the mean of its divisors is an integer number (34345718031468).
Almost surely, 2120210013110131 is an apocalyptic number.
120210013110131 is a deficient number, since it is larger than the sum of its proper divisors (17172859015741).
120210013110131 is an equidigital number, since it uses as much as digits as its factorization.
120210013110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17172859015740.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 120210013110131 its reverse (131011310012021), we get a palindrome (251221323122152).
The spelling of 120210013110131 in words is "one hundred twenty trillion, two hundred ten billion, thirteen million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •