Base | Representation |
---|---|
bin | 1011000110001000111111… |
… | …1000100110011011110101 |
3 | 1121012022122102020022021211 |
4 | 2301202033320212123311 |
5 | 3044341322000200041 |
6 | 41540354103441421 |
7 | 2366300242211551 |
oct | 261421770463365 |
9 | 47168572208254 |
10 | 12200121100021 |
11 | 3984051339268 |
12 | 145056ba56271 |
13 | 6a660ab2c57a |
14 | 3026bbbc4861 |
15 | 162546d16481 |
hex | b188fe266f5 |
12200121100021 has 8 divisors (see below), whose sum is σ = 12735611014464. Its totient is φ = 11665052007840.
The previous prime is 12200121099983. The next prime is 12200121100033. The reversal of 12200121100021 is 12000112100221.
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 12200121100021 - 219 = 12200120575733 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12200121099974 and 12200121100010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200121100721) 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, 105146311 + ... + 105262276.
It is an arithmetic number, because the mean of its divisors is an integer number (1591951376808).
Almost surely, 212200121100021 is an apocalyptic number.
It is an amenable number.
12200121100021 is a deficient number, since it is larger than the sum of its proper divisors (535489914443).
12200121100021 is a wasteful number, since it uses less digits than its factorization.
12200121100021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210411131.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12200121100021 its reverse (12000112100221), we get a palindrome (24200233200242).
The spelling of 12200121100021 in words is "twelve trillion, two hundred billion, one hundred twenty-one million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •