Base | Representation |
---|---|
bin | 110000000100010010… |
… | …0100101011011000111 |
3 | 100212102210022220001011 |
4 | 1200020210211123013 |
5 | 3142400043221203 |
6 | 115230415343051 |
7 | 10312651135621 |
oct | 1401044453307 |
9 | 325383286034 |
10 | 103223023303 |
11 | 3a85a784224 |
12 | 18009221a87 |
13 | 997047c81a |
14 | 4dd311dc11 |
15 | 2a4218476d |
hex | 18089256c7 |
103223023303 has 4 divisors (see below), whose sum is σ = 103233110968. Its totient is φ = 103212935640.
The previous prime is 103223023291. The next prime is 103223023417. The reversal of 103223023303 is 303320322301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 303320322301 = 89 ⋅3408093509.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103223023303 is a prime.
It is a super-3 number, since 3×1032230233033 (a number of 34 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 (103223023003) 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, 5028468 + ... + 5048953.
It is an arithmetic number, because the mean of its divisors is an integer number (25808277742).
Almost surely, 2103223023303 is an apocalyptic number.
103223023303 is a deficient number, since it is larger than the sum of its proper divisors (10087665).
103223023303 is a wasteful number, since it uses less digits than its factorization.
103223023303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10087664.
The product of its (nonzero) digits is 1944, while the sum is 22.
Adding to 103223023303 its reverse (303320322301), we get a palindrome (406543345604).
The spelling of 103223023303 in words is "one hundred three billion, two hundred twenty-three million, twenty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •