Base | Representation |
---|---|
bin | 10001110010001100110… |
… | …100010011000111100101 |
3 | 11022211112120021210112112 |
4 | 101302030310103013211 |
5 | 130010412101411401 |
6 | 2333235032330405 |
7 | 154203413033345 |
oct | 21621464230745 |
9 | 4284476253475 |
10 | 1222133232101 |
11 | 431338391a51 |
12 | 178a35b43a05 |
13 | 8b328c17652 |
14 | 43219c6ad25 |
15 | 21bccd853bb |
hex | 11c8cd131e5 |
1222133232101 has 8 divisors (see below), whose sum is σ = 1223913573504. Its totient is φ = 1220353349920.
The previous prime is 1222133232011. The next prime is 1222133232107. The reversal of 1222133232101 is 1012323312221.
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 1222133232101 - 218 = 1222132969957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222133232107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5404166 + ... + 5625768.
It is an arithmetic number, because the mean of its divisors is an integer number (152989196688).
Almost surely, 21222133232101 is an apocalyptic number.
It is an amenable number.
1222133232101 is a deficient number, since it is larger than the sum of its proper divisors (1780341403).
1222133232101 is an equidigital number, since it uses as much as digits as its factorization.
1222133232101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229611.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1222133232101 its reverse (1012323312221), we get a palindrome (2234456544322).
The spelling of 1222133232101 in words is "one trillion, two hundred twenty-two billion, one hundred thirty-three million, two hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •