Base | Representation |
---|---|
bin | 110000000011101100… |
… | …1011011010110000111 |
3 | 100212101102020220212111 |
4 | 1200013121123112013 |
5 | 3142330022234343 |
6 | 115224433201451 |
7 | 10312321520302 |
oct | 1400731332607 |
9 | 325342226774 |
10 | 103203321223 |
11 | 3a84a647812 |
12 | 18002700287 |
13 | 9969371ba2 |
14 | 4dd0671b39 |
15 | 2a40591c9d |
hex | 180765b587 |
103203321223 has 8 divisors (see below), whose sum is σ = 103545001728. Its totient is φ = 102861717504.
The previous prime is 103203321203. The next prime is 103203321233. The reversal of 103203321223 is 322123302301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103203321223 is a prime.
It is a super-2 number, since 2×1032033212232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103203321194 and 103203321203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103203321203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4154586 + ... + 4179352.
It is an arithmetic number, because the mean of its divisors is an integer number (12943125216).
Almost surely, 2103203321223 is an apocalyptic number.
103203321223 is a deficient number, since it is larger than the sum of its proper divisors (341680505).
103203321223 is a wasteful number, since it uses less digits than its factorization.
103203321223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38393.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 103203321223 its reverse (322123302301), we get a palindrome (425326623524).
The spelling of 103203321223 in words is "one hundred three billion, two hundred three million, three hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •