Base | Representation |
---|---|
bin | 11011010010011001001000… |
… | …111100100100011010111001 |
3 | 120201220221212212121010001112 |
4 | 123102121020330210122321 |
5 | 111212230414201202301 |
6 | 1103124214552130105 |
7 | 34164344261616125 |
oct | 3322311074443271 |
9 | 521827785533045 |
10 | 120011200022201 |
11 | 3526a5117aa704 |
12 | 11562b84096935 |
13 | 51c7013918747 |
14 | 218c80472a585 |
15 | dd1b77a559bb |
hex | 6d2648f246b9 |
120011200022201 has 2 divisors, whose sum is σ = 120011200022202. Its totient is φ = 120011200022200.
The previous prime is 120011200022179. The next prime is 120011200022243. The reversal of 120011200022201 is 102220002110021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 62587465178176 + 57423734844025 = 7911224^2 + 7577845^2 .
It is a cyclic number.
It is not a de Polignac number, because 120011200022201 - 226 = 120011132913337 is a prime.
It is not a weakly prime, because it can be changed into another prime (120011200022261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60005600011100 + 60005600011101.
It is an arithmetic number, because the mean of its divisors is an integer number (60005600011101).
Almost surely, 2120011200022201 is an apocalyptic number.
It is an amenable number.
120011200022201 is a deficient number, since it is larger than the sum of its proper divisors (1).
120011200022201 is an equidigital number, since it uses as much as digits as its factorization.
120011200022201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 120011200022201 its reverse (102220002110021), we get a palindrome (222231202132222).
The spelling of 120011200022201 in words is "one hundred twenty trillion, eleven billion, two hundred million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •