Base | Representation |
---|---|
bin | 1011001100001001000101… |
… | …0000010010011111010111 |
3 | 1121120011202210012211202221 |
4 | 2303002101100102133113 |
5 | 3103034000131131403 |
6 | 42100004525443211 |
7 | 2406610225366156 |
oct | 263022120223727 |
9 | 47504683184687 |
10 | 12303223302103 |
11 | 3a1384989a738 |
12 | 1468544710507 |
13 | 6b325c258436 |
14 | 30769cc5359d |
15 | 16507d581dbd |
hex | b30914127d7 |
12303223302103 has 4 divisors (see below), whose sum is σ = 12332586603960. Its totient is φ = 12273860000248.
The previous prime is 12303223302101. The next prime is 12303223302119. The reversal of 12303223302103 is 30120332230321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12303223302103 - 21 = 12303223302101 is a prime.
It is a super-3 number, since 3×123032233021033 (a number of 40 digits) contains 333 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 (12303223302101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14681650300 + ... + 14681651137.
It is an arithmetic number, because the mean of its divisors is an integer number (3083146650990).
Almost surely, 212303223302103 is an apocalyptic number.
12303223302103 is a deficient number, since it is larger than the sum of its proper divisors (29363301857).
12303223302103 is an equidigital number, since it uses as much as digits as its factorization.
12303223302103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29363301856.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 12303223302103 its reverse (30120332230321), we get a palindrome (42423555532424).
The spelling of 12303223302103 in words is "twelve trillion, three hundred three billion, two hundred twenty-three million, three hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •