Base | Representation |
---|---|
bin | 1011000110010000000010… |
… | …0010000101001101111001 |
3 | 1121012111112010110022010121 |
4 | 2301210000202011031321 |
5 | 3044404204310202301 |
6 | 41541305415213241 |
7 | 2366365131246010 |
oct | 261440042051571 |
9 | 47174463408117 |
10 | 12202011022201 |
11 | 3984931130820 |
12 | 14509b8977221 |
13 | 6a684c545010 |
14 | 30281abc7a77 |
15 | 162607bd33a1 |
hex | b1900885379 |
12202011022201 has 64 divisors (see below), whose sum is σ = 16663594752000. Its totient is φ = 8626466764800.
The previous prime is 12202011022163. The next prime is 12202011022231. The reversal of 12202011022201 is 10222011020221.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 12202011022201 - 213 = 12202011014009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12202011022231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 451728786 + ... + 451755796.
It is an arithmetic number, because the mean of its divisors is an integer number (260368668000).
Almost surely, 212202011022201 is an apocalyptic number.
12202011022201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12202011022201 is a deficient number, since it is larger than the sum of its proper divisors (4461583729799).
12202011022201 is a wasteful number, since it uses less digits than its factorization.
12202011022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34750.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12202011022201 its reverse (10222011020221), we get a palindrome (22424022042422).
The spelling of 12202011022201 in words is "twelve trillion, two hundred two billion, eleven million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •