Base | Representation |
---|---|
bin | 1011000111010111001011… |
… | …1111110111011111010111 |
3 | 1121021022211021000001102202 |
4 | 2301311302333313133113 |
5 | 3100212313443131403 |
6 | 41554145004355115 |
7 | 2400642350041154 |
oct | 261656277673727 |
9 | 47238737001382 |
10 | 12221111302103 |
11 | 3991a427a9810 |
12 | 1454649545a9b |
13 | 6a85a46c37a2 |
14 | 30370d7c722b |
15 | 162d7497a688 |
hex | b1d72ff77d7 |
12221111302103 has 16 divisors (see below), whose sum is σ = 13946814381600. Its totient is φ = 10606466196480.
The previous prime is 12221111302093. The next prime is 12221111302111. The reversal of 12221111302103 is 30120311112221.
It is not a de Polignac number, because 12221111302103 - 24 = 12221111302087 is a prime.
It is a super-2 number, since 2×122211113021032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12221111302003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 215200226 + ... + 215257007.
It is an arithmetic number, because the mean of its divisors is an integer number (871675898850).
Almost surely, 212221111302103 is an apocalyptic number.
12221111302103 is a deficient number, since it is larger than the sum of its proper divisors (1725703079497).
12221111302103 is a wasteful number, since it uses less digits than its factorization.
12221111302103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430457362.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 12221111302103 its reverse (30120311112221), we get a palindrome (42341422414324).
The spelling of 12221111302103 in words is "twelve trillion, two hundred twenty-one billion, one hundred eleven million, three hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •