Base | Representation |
---|---|
bin | 1011000000011111010001… |
… | …1010010010010100001111 |
3 | 1120212001000111210022001022 |
4 | 2300013310122102110033 |
5 | 3041243442442414203 |
6 | 41424015135104355 |
7 | 2356262126341556 |
oct | 260076432222417 |
9 | 46761014708038 |
10 | 12103023404303 |
11 | 3946955206347 |
12 | 14357920720bb |
13 | 69a4056b9650 |
14 | 2dbb0a3b8d9d |
15 | 15ec627c3a38 |
hex | b01f469250f |
12103023404303 has 4 divisors (see below), whose sum is σ = 13034025204648. Its totient is φ = 11172021603960.
The previous prime is 12103023404287. The next prime is 12103023404377. The reversal of 12103023404303 is 30340432030121.
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 12103023404303 - 24 = 12103023404287 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12103023404803) 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, 465500900153 + ... + 465500900178.
It is an arithmetic number, because the mean of its divisors is an integer number (3258506301162).
Almost surely, 212103023404303 is an apocalyptic number.
12103023404303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12103023404303 is a deficient number, since it is larger than the sum of its proper divisors (931001800345).
12103023404303 is an equidigital number, since it uses as much as digits as its factorization.
12103023404303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 931001800344.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 12103023404303 its reverse (30340432030121), we get a palindrome (42443455434424).
The spelling of 12103023404303 in words is "twelve trillion, one hundred three billion, twenty-three million, four hundred four thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •