Base | Representation |
---|---|
bin | 11011100000100111000111… |
… | …111000111101110000001101 |
3 | 120212101100220202210200220111 |
4 | 123200213013320331300031 |
5 | 111324233003031010023 |
6 | 1105153130224520021 |
7 | 34325054356142563 |
oct | 3340470770756015 |
9 | 525340822720814 |
10 | 120988287360013 |
11 | 35606932069347 |
12 | 116a0410780011 |
13 | 52681b9c543b8 |
14 | 21c3c15adba33 |
15 | dec2b29b000d |
hex | 6e09c7e3dc0d |
120988287360013 has 2 divisors, whose sum is σ = 120988287360014. Its totient is φ = 120988287360012.
The previous prime is 120988287359969. The next prime is 120988287360019. The reversal of 120988287360013 is 310063782889021.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119117076761929 + 1871210598084 = 10914077^2 + 1367922^2 .
It is a cyclic number.
It is not a de Polignac number, because 120988287360013 - 29 = 120988287359501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120988287360013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120988287360019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60494143680006 + 60494143680007.
It is an arithmetic number, because the mean of its divisors is an integer number (60494143680007).
Almost surely, 2120988287360013 is an apocalyptic number.
It is an amenable number.
120988287360013 is a deficient number, since it is larger than the sum of its proper divisors (1).
120988287360013 is an equidigital number, since it uses as much as digits as its factorization.
120988287360013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6967296, while the sum is 58.
The spelling of 120988287360013 in words is "one hundred twenty trillion, nine hundred eighty-eight billion, two hundred eighty-seven million, three hundred sixty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •