Base | Representation |
---|---|
bin | 1011000110010100100101… |
… | …1000101101100111101101 |
3 | 1121012121200022101121012121 |
4 | 2301211021120231213231 |
5 | 3044414210211144041 |
6 | 41542031001032541 |
7 | 2366440332412645 |
oct | 261451130554755 |
9 | 47177608347177 |
10 | 12203233303021 |
11 | 39853a9075462 |
12 | 145109a185751 |
13 | 6a69b583aac7 |
14 | 3028d5277525 |
15 | 16267a1707d1 |
hex | b194962d9ed |
12203233303021 has 2 divisors, whose sum is σ = 12203233303022. Its totient is φ = 12203233303020.
The previous prime is 12203233303003. The next prime is 12203233303043. The reversal of 12203233303021 is 12030333230221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9317359429225 + 2885873873796 = 3052435^2 + 1698786^2 .
It is a cyclic number.
It is not a de Polignac number, because 12203233303021 - 225 = 12203199748589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12203233303721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101616651510 + 6101616651511.
It is an arithmetic number, because the mean of its divisors is an integer number (6101616651511).
Almost surely, 212203233303021 is an apocalyptic number.
It is an amenable number.
12203233303021 is a deficient number, since it is larger than the sum of its proper divisors (1).
12203233303021 is an equidigital number, since it uses as much as digits as its factorization.
12203233303021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 12203233303021 its reverse (12030333230221), we get a palindrome (24233566533242).
The spelling of 12203233303021 in words is "twelve trillion, two hundred three billion, two hundred thirty-three million, three hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •