Base | Representation |
---|---|
bin | 11011010101100110111000… |
… | …010100111011011100101001 |
3 | 120202201002002121110220022102 |
4 | 123111212320110323130221 |
5 | 111224340331133323144 |
6 | 1103413511510503145 |
7 | 34216324550550503 |
oct | 3325467024733451 |
9 | 522632077426272 |
10 | 120232112011049 |
11 | 35345174870615 |
12 | 11599957064ab5 |
13 | 5211abb545acc |
14 | 219939dc90d73 |
15 | dd77a6d3eb4e |
hex | 6d59b853b729 |
120232112011049 has 2 divisors, whose sum is σ = 120232112011050. Its totient is φ = 120232112011048.
The previous prime is 120232112011027. The next prime is 120232112011051. The reversal of 120232112011049 is 940110211232021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88595626875625 + 31636485135424 = 9412525^2 + 5624632^2 .
It is a cyclic number.
It is not a de Polignac number, because 120232112011049 - 28 = 120232112010793 is a prime.
It is a super-2 number, since 2×1202321120110492 (a number of 29 digits) contains 22 as substring.
Together with 120232112011051, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (120232112011079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60116056005524 + 60116056005525.
It is an arithmetic number, because the mean of its divisors is an integer number (60116056005525).
Almost surely, 2120232112011049 is an apocalyptic number.
It is an amenable number.
120232112011049 is a deficient number, since it is larger than the sum of its proper divisors (1).
120232112011049 is an equidigital number, since it uses as much as digits as its factorization.
120232112011049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 29.
The spelling of 120232112011049 in words is "one hundred twenty trillion, two hundred thirty-two billion, one hundred twelve million, eleven thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •