Base | Representation |
---|---|
bin | 1011000110001100010011… |
… | …1111001100101110111001 |
3 | 1121012101221111122211202121 |
4 | 2301203010333030232321 |
5 | 3044400133034202301 |
6 | 41541022331201241 |
7 | 2366331311011402 |
oct | 261430477145671 |
9 | 47171844584677 |
10 | 12201012022201 |
11 | 3984469230292 |
12 | 145077a2a6221 |
13 | 6a6720598062 |
14 | 30276425a9a9 |
15 | 16259a14d3a1 |
hex | b18c4fccbb9 |
12201012022201 has 4 divisors (see below), whose sum is σ = 12229993048804. Its totient is φ = 12172030995600.
The previous prime is 12201012022193. The next prime is 12201012022207. The reversal of 12201012022201 is 10222021010221.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6295256631225 + 5905755390976 = 2509035^2 + 2430176^2 .
It is a cyclic number.
It is not a de Polignac number, because 12201012022201 - 23 = 12201012022193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12201012022207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14490512670 + ... + 14490513511.
It is an arithmetic number, because the mean of its divisors is an integer number (3057498262201).
Almost surely, 212201012022201 is an apocalyptic number.
It is an amenable number.
12201012022201 is a deficient number, since it is larger than the sum of its proper divisors (28981026603).
12201012022201 is an equidigital number, since it uses as much as digits as its factorization.
12201012022201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28981026602.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12201012022201 its reverse (10222021010221), we get a palindrome (22423033032422).
The spelling of 12201012022201 in words is "twelve trillion, two hundred one billion, twelve million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •