Base | Representation |
---|---|
bin | 1011000110001000111101… |
… | …0110101001101000001001 |
3 | 1121012022121210111011000212 |
4 | 2301202033112221220021 |
5 | 3044341312210401301 |
6 | 41540353145010505 |
7 | 2366300103443552 |
oct | 261421726515011 |
9 | 47168553434025 |
10 | 12200112200201 |
11 | 398404730a742 |
12 | 1450568a83a35 |
13 | 6a66090346c3 |
14 | 3026ba949329 |
15 | 1625461594bb |
hex | b188f5a9a09 |
12200112200201 has 4 divisors (see below), whose sum is σ = 12320905390404. Its totient is φ = 12079319010000.
The previous prime is 12200112200197. The next prime is 12200112200207. The reversal of 12200112200201 is 10200221100221.
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 5272167054400 + 6927945145801 = 2296120^2 + 2632099^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200112200201 - 22 = 12200112200197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12200112200207) 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, 60396594950 + ... + 60396595151.
It is an arithmetic number, because the mean of its divisors is an integer number (3080226347601).
Almost surely, 212200112200201 is an apocalyptic number.
It is an amenable number.
12200112200201 is a deficient number, since it is larger than the sum of its proper divisors (120793190203).
12200112200201 is a wasteful number, since it uses less digits than its factorization.
12200112200201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120793190202.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12200112200201 its reverse (10200221100221), we get a palindrome (22400333300422).
The spelling of 12200112200201 in words is "twelve trillion, two hundred billion, one hundred twelve million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •