Base | Representation |
---|---|
bin | 1011000110001001010111… |
… | …0110000100111110110001 |
3 | 1121012022220101101221012212 |
4 | 2301202111312010332301 |
5 | 3044342023100231001 |
6 | 41540412035101505 |
7 | 2366302565212532 |
oct | 261422566047661 |
9 | 47168811357185 |
10 | 12200221102001 |
11 | 39840a2831229 |
12 | 1450599441895 |
13 | 6a6625773c3a |
14 | 3026cb1b6689 |
15 | 1625509bb7bb |
hex | b1895d84fb1 |
12200221102001 has 8 divisors (see below), whose sum is σ = 12469232434944. Its totient is φ = 11931602775840.
The previous prime is 12200221101941. The next prime is 12200221102009. The reversal of 12200221102001 is 10020112200221.
12200221102001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12200221102001 - 218 = 12200220839857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12200221102009) 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, 98188925 + ... + 98313098.
It is an arithmetic number, because the mean of its divisors is an integer number (1558654054368).
Almost surely, 212200221102001 is an apocalyptic number.
It is an amenable number.
12200221102001 is a deficient number, since it is larger than the sum of its proper divisors (269011332943).
12200221102001 is a wasteful number, since it uses less digits than its factorization.
12200221102001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196503391.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12200221102001 its reverse (10020112200221), we get a palindrome (22220333302222).
The spelling of 12200221102001 in words is "twelve trillion, two hundred billion, two hundred twenty-one million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •