Base | Representation |
---|---|
bin | 1011000110001100101001… |
… | …0011000101101000110101 |
3 | 1121012102011201022120211220 |
4 | 2301203022103011220311 |
5 | 3044400323341401401 |
6 | 41541035233020553 |
7 | 2366333442235023 |
oct | 261431223055065 |
9 | 47172151276756 |
10 | 12201101122101 |
11 | 3984504557371 |
12 | 14507a40b4759 |
13 | 6a6735b933a8 |
14 | 302772011713 |
15 | 1625a2d9d336 |
hex | b18ca4c5a35 |
12201101122101 has 4 divisors (see below), whose sum is σ = 16268134829472. Its totient is φ = 8134067414732.
The previous prime is 12201101122081. The next prime is 12201101122103. The reversal of 12201101122101 is 10122110110221.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12201101122101 - 213 = 12201101113909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201101122103) 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, 2033516853681 + ... + 2033516853686.
It is an arithmetic number, because the mean of its divisors is an integer number (4067033707368).
Almost surely, 212201101122101 is an apocalyptic number.
It is an amenable number.
12201101122101 is a deficient number, since it is larger than the sum of its proper divisors (4067033707371).
12201101122101 is an equidigital number, since it uses as much as digits as its factorization.
12201101122101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4067033707370.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 12201101122101 its reverse (10122110110221), we get a palindrome (22323211232322).
The spelling of 12201101122101 in words is "twelve trillion, two hundred one billion, one hundred one million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •