Base | Representation |
---|---|
bin | 1001011101100010100100… |
… | …0110011000110010111001 |
3 | 1100211112012221121202200102 |
4 | 2113120221012120302321 |
5 | 2330421022141044233 |
6 | 34043041320045145 |
7 | 2122412344542623 |
oct | 227305106306271 |
9 | 40745187552612 |
10 | 10403100331193 |
11 | 3350a25a240a9 |
12 | 12002353037b5 |
13 | 5a6014ba955b |
14 | 27d726d73c13 |
15 | 13091daed1e8 |
hex | 97629198cb9 |
10403100331193 has 8 divisors (see below), whose sum is σ = 10646808941760. Its totient is φ = 10161637883280.
The previous prime is 10403100331171. The next prime is 10403100331223. The reversal of 10403100331193 is 39113300130401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10403100331193 - 28 = 10403100330937 is a prime.
It is a super-3 number, since 3×104031003311933 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10403100339193) 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, 561531293 + ... + 561549818.
It is an arithmetic number, because the mean of its divisors is an integer number (1330851117720).
Almost surely, 210403100331193 is an apocalyptic number.
It is an amenable number.
10403100331193 is a deficient number, since it is larger than the sum of its proper divisors (243708610567).
10403100331193 is a wasteful number, since it uses less digits than its factorization.
10403100331193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1123081327.
The product of its (nonzero) digits is 2916, while the sum is 29.
Adding to 10403100331193 its reverse (39113300130401), we get a palindrome (49516400461594).
The spelling of 10403100331193 in words is "ten trillion, four hundred three billion, one hundred million, three hundred thirty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •