Base | Representation |
---|---|
bin | 1011000111011000000010… |
… | …1100010000011000100011 |
3 | 1121021100102021022001121122 |
4 | 2301312000230100120203 |
5 | 3100213301301322321 |
6 | 41554223452442455 |
7 | 2400651136562330 |
oct | 261660054203043 |
9 | 47240367261548 |
10 | 12221341042211 |
11 | 3992050454974 |
12 | 14546b247942b |
13 | 6a8610191692 |
14 | 30373210b987 |
15 | 162d89c0b8ab |
hex | b1d80b10623 |
12221341042211 has 16 divisors (see below), whose sum is σ = 14498265384960. Its totient is φ = 10084478914080.
The previous prime is 12221341042189. The next prime is 12221341042217. The reversal of 12221341042211 is 11224014312221.
It is a cyclic number.
It is not a de Polignac number, because 12221341042211 - 226 = 12221273933347 is a prime.
It is a super-2 number, since 2×122213410422112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12221341042217) 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 15 ways as a sum of consecutive naturals, for example, 304462991 + ... + 304503128.
It is an arithmetic number, because the mean of its divisors is an integer number (906141586560).
Almost surely, 212221341042211 is an apocalyptic number.
12221341042211 is a deficient number, since it is larger than the sum of its proper divisors (2276924342749).
12221341042211 is an equidigital number, since it uses as much as digits as its factorization.
12221341042211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 608966234.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 12221341042211 its reverse (11224014312221), we get a palindrome (23445355354432).
The spelling of 12221341042211 in words is "twelve trillion, two hundred twenty-one billion, three hundred forty-one million, forty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •