Base | Representation |
---|---|
bin | 1011000110010100111000… |
… | …1001100010011011011111 |
3 | 1121012121212212202100111012 |
4 | 2301211032021202123133 |
5 | 3044414341140223403 |
6 | 41542042533445435 |
7 | 2366442322544060 |
oct | 261451611423337 |
9 | 47177785670435 |
10 | 12203313211103 |
11 | 398543a1935a3 |
12 | 1451100aa087b |
13 | 6a69c92683b1 |
14 | 302901b18567 |
15 | 1626821a6ed8 |
hex | b194e2626df |
12203313211103 has 16 divisors (see below), whose sum is σ = 14065452878400. Its totient is φ = 10371127923456.
The previous prime is 12203313211097. The next prime is 12203313211169. The reversal of 12203313211103 is 30111231330221.
It is a cyclic number.
It is not a de Polignac number, because 12203313211103 - 216 = 12203313145567 is a prime.
It is a super-3 number, since 3×122033132111033 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12203313213103) 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 in 15 ways as a sum of consecutive naturals, for example, 9921926 + ... + 11083827.
It is an arithmetic number, because the mean of its divisors is an integer number (879090804900).
Almost surely, 212203313211103 is an apocalyptic number.
12203313211103 is a deficient number, since it is larger than the sum of its proper divisors (1862139667297).
12203313211103 is a wasteful number, since it uses less digits than its factorization.
12203313211103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21006466.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12203313211103 its reverse (30111231330221), we get a palindrome (42314544541324).
The spelling of 12203313211103 in words is "twelve trillion, two hundred three billion, three hundred thirteen million, two hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •