Base | Representation |
---|---|
bin | 10001011101110001100… |
… | …011100001000000010110 |
3 | 11020201221001221112112112 |
4 | 101131301203201000112 |
5 | 124131002424324342 |
6 | 2315210440551022 |
7 | 152466046161413 |
oct | 21356143410026 |
9 | 4221831845475 |
10 | 1200201011222 |
11 | 4230031aa874 |
12 | 174734a82472 |
13 | 89242137365 |
14 | 421390d110a |
15 | 21347694682 |
hex | 117718e1016 |
1200201011222 has 8 divisors (see below), whose sum is σ = 1800320812896. Its totient is φ = 600094073592.
The previous prime is 1200201011209. The next prime is 1200201011227. The reversal of 1200201011222 is 2221101020021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×12002010112222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1200201011197 and 1200201011206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200201011227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2979278 + ... + 3358049.
It is an arithmetic number, because the mean of its divisors is an integer number (225040101612).
Almost surely, 21200201011222 is an apocalyptic number.
1200201011222 is a deficient number, since it is larger than the sum of its proper divisors (600119801674).
1200201011222 is an equidigital number, since it uses as much as digits as its factorization.
1200201011222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6432022.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1200201011222 its reverse (2221101020021), we get a palindrome (3421302031243).
The spelling of 1200201011222 in words is "one trillion, two hundred billion, two hundred one million, eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •