Base | Representation |
---|---|
bin | 110000000111100000… |
… | …0111010010100011111 |
3 | 100212201022201101011111 |
4 | 1200033000322110133 |
5 | 3143110231042343 |
6 | 115245240202451 |
7 | 10315432650643 |
oct | 1401700722437 |
9 | 325638641144 |
10 | 103331112223 |
11 | 3a9057a0009 |
12 | 18039469427 |
13 | 9989996071 |
14 | 5003618c23 |
15 | 2a4b8d5c9d |
hex | 180f03a51f |
103331112223 has 8 divisors (see below), whose sum is σ = 109455062400. Its totient is φ = 97212234240.
The previous prime is 103331112217. The next prime is 103331112239. The reversal of 103331112223 is 322211133301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103331112223 - 217 = 103330981151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103331112194 and 103331112203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103331512223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1226058 + ... + 1307623.
It is an arithmetic number, because the mean of its divisors is an integer number (13681882800).
Almost surely, 2103331112223 is an apocalyptic number.
103331112223 is a deficient number, since it is larger than the sum of its proper divisors (6123950177).
103331112223 is a wasteful number, since it uses less digits than its factorization.
103331112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2536097.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 103331112223 its reverse (322211133301), we get a palindrome (425542245524).
The spelling of 103331112223 in words is "one hundred three billion, three hundred thirty-one million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •