Base | Representation |
---|---|
bin | 11011010010100010010010… |
… | …010001100111011110000001 |
3 | 120201221220020021000101200111 |
4 | 123102202102101213132001 |
5 | 111212411022133223243 |
6 | 1103132521232551321 |
7 | 34165142524060312 |
oct | 3322422221473601 |
9 | 521856207011614 |
10 | 120021020211073 |
11 | 352736a0a70983 |
12 | 11564a649b2541 |
13 | 51c7c1a299ca7 |
14 | 218d096a44609 |
15 | dd204ec4639d |
hex | 6d2892467781 |
120021020211073 has 2 divisors, whose sum is σ = 120021020211074. Its totient is φ = 120021020211072.
The previous prime is 120021020211067. The next prime is 120021020211137. The reversal of 120021020211073 is 370112020120021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106956612372289 + 13064407838784 = 10341983^2 + 3614472^2 .
It is a cyclic number.
It is not a de Polignac number, because 120021020211073 - 241 = 117821996955521 is a prime.
It is a super-2 number, since 2×1200210202110732 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (120021020211373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60010510105536 + 60010510105537.
It is an arithmetic number, because the mean of its divisors is an integer number (60010510105537).
Almost surely, 2120021020211073 is an apocalyptic number.
It is an amenable number.
120021020211073 is a deficient number, since it is larger than the sum of its proper divisors (1).
120021020211073 is an equidigital number, since it uses as much as digits as its factorization.
120021020211073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 120021020211073 its reverse (370112020120021), we get a palindrome (490133040331094).
The spelling of 120021020211073 in words is "one hundred twenty trillion, twenty-one billion, twenty million, two hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •