Base | Representation |
---|---|
bin | 1010111001111011011011… |
… | …1100010000010101101101 |
3 | 1120110021010020001010222111 |
4 | 2232132312330100111231 |
5 | 3032422140140101023 |
6 | 41300140041444021 |
7 | 2345162244434641 |
oct | 256366674202555 |
9 | 46407106033874 |
10 | 11990322972013 |
11 | 3903081804511 |
12 | 141797aaa0611 |
13 | 68c8b48b4319 |
14 | 2d64986ccc21 |
15 | 15bd685ad00d |
hex | ae7b6f1056d |
11990322972013 has 2 divisors, whose sum is σ = 11990322972014. Its totient is φ = 11990322972012.
The previous prime is 11990322971971. The next prime is 11990322972059. The reversal of 11990322972013 is 31027922309911.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8408683451529 + 3581639520484 = 2899773^2 + 1892522^2 .
It is a cyclic number.
It is not a de Polignac number, because 11990322972013 - 229 = 11989786101101 is a prime.
It is a super-2 number, since 2×119903229720132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11990322972613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5995161486006 + 5995161486007.
It is an arithmetic number, because the mean of its divisors is an integer number (5995161486007).
Almost surely, 211990322972013 is an apocalyptic number.
It is an amenable number.
11990322972013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11990322972013 is an equidigital number, since it uses as much as digits as its factorization.
11990322972013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 367416, while the sum is 49.
The spelling of 11990322972013 in words is "eleven trillion, nine hundred ninety billion, three hundred twenty-two million, nine hundred seventy-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •