Base | Representation |
---|---|
bin | 10110101110011111… |
… | …11001000101100101 |
3 | 1011111022201021122011 |
4 | 23113033321011211 |
5 | 144442001431041 |
6 | 5334414034221 |
7 | 611233335361 |
oct | 132717710545 |
9 | 34438637564 |
10 | 12201202021 |
11 | 51a1295738 |
12 | 24461a8971 |
13 | 11c5a4cc88 |
14 | 83a6342a1 |
15 | 4b6265e81 |
hex | 2d73f9165 |
12201202021 has 8 divisors (see below), whose sum is σ = 12464202240. Its totient is φ = 11938343568.
The previous prime is 12201202009. The next prime is 12201202033. The reversal of 12201202021 is 12020210221.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12201202009) and next prime (12201202033).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12201202021 - 27 = 12201201893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12201201992 and 12201202010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201202001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 148740 + ... + 215698.
It is an arithmetic number, because the mean of its divisors is an integer number (1558025280).
Almost surely, 212201202021 is an apocalyptic number.
It is an amenable number.
12201202021 is a deficient number, since it is larger than the sum of its proper divisors (263000219).
12201202021 is an equidigital number, since it uses as much as digits as its factorization.
12201202021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70883.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 12201202021 its reverse (12020210221), we get a palindrome (24221412242).
The spelling of 12201202021 in words is "twelve billion, two hundred one million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •