Base | Representation |
---|---|
bin | 1011000110010100001011… |
… | …0000111110000000101101 |
3 | 1121012121101120101001110102 |
4 | 2301211002300332000231 |
5 | 3044413443242033401 |
6 | 41542011552120445 |
7 | 2366434513263650 |
oct | 261450260760055 |
9 | 47177346331412 |
10 | 12203122221101 |
11 | 39853513a4a19 |
12 | 1451068b36125 |
13 | 6a6998817166 |
14 | 3028c45dd897 |
15 | 16267052c56b |
hex | b1942c3e02d |
12203122221101 has 8 divisors (see below), whose sum is σ = 14427336616320. Its totient is φ = 10099135631088.
The previous prime is 12203122221091. The next prime is 12203122221127. The reversal of 12203122221101 is 10112222130221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12203122221101 - 218 = 12203121958957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12203122224101) 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, 30056951081 + ... + 30056951486.
It is an arithmetic number, because the mean of its divisors is an integer number (1803417077040).
Almost surely, 212203122221101 is an apocalyptic number.
It is an amenable number.
12203122221101 is a deficient number, since it is larger than the sum of its proper divisors (2224214395219).
12203122221101 is an equidigital number, since it uses as much as digits as its factorization.
12203122221101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60113902603.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 12203122221101 its reverse (10112222130221), we get a palindrome (22315344351322).
The spelling of 12203122221101 in words is "twelve trillion, two hundred three billion, one hundred twenty-two million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •