Base | Representation |
---|---|
bin | 1011000110001100010011… |
… | …0111100001111110101001 |
3 | 1121012101221100212201101102 |
4 | 2301203010313201332221 |
5 | 3044400132030341243 |
6 | 41541022220131145 |
7 | 2366331254640101 |
oct | 261430467417651 |
9 | 47171840781342 |
10 | 12201010012073 |
11 | 3984468088023 |
12 | 1450779696ab5 |
13 | 6a672004312c |
14 | 302763c96201 |
15 | 162599da29b8 |
hex | b18c4de1fa9 |
12201010012073 has 2 divisors, whose sum is σ = 12201010012074. Its totient is φ = 12201010012072.
The previous prime is 12201010012043. The next prime is 12201010012111. The reversal of 12201010012073 is 37021001010221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9196098705049 + 3004911307024 = 3032507^2 + 1733468^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12201010012073 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (12201010012033) 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, 6100505006036 + 6100505006037.
It is an arithmetic number, because the mean of its divisors is an integer number (6100505006037).
Almost surely, 212201010012073 is an apocalyptic number.
It is an amenable number.
12201010012073 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201010012073 is an equidigital number, since it uses as much as digits as its factorization.
12201010012073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 12201010012073 its reverse (37021001010221), we get a palindrome (49222011022294).
The spelling of 12201010012073 in words is "twelve trillion, two hundred one billion, ten million, twelve thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •