Base | Representation |
---|---|
bin | 110011101100001001… |
… | …1100111001100001001 |
3 | 101121112000002221020022 |
4 | 1213120103213030021 |
5 | 3304313304433223 |
6 | 122554423510225 |
7 | 11006522436353 |
oct | 1473023471411 |
9 | 347460087208 |
10 | 111003202313 |
11 | 43092460933 |
12 | 1961a8b8375 |
13 | a6102b8843 |
14 | 55305260d3 |
15 | 2d4a20cac8 |
hex | 19d84e7309 |
111003202313 has 8 divisors (see below), whose sum is σ = 114009988680. Its totient is φ = 107996768640.
The previous prime is 111003202253. The next prime is 111003202319. The reversal of 111003202313 is 313202300111.
It can be written as a sum of positive squares in 4 ways, for example, as 4956582409 + 106046619904 = 70403^2 + 325648^2 .
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-111003202313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111003202291 and 111003202300.
It is not an unprimeable number, because it can be changed into a prime (111003202319) 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, 627383 + ... + 784611.
It is an arithmetic number, because the mean of its divisors is an integer number (14251248585).
Almost surely, 2111003202313 is an apocalyptic number.
It is an amenable number.
111003202313 is a deficient number, since it is larger than the sum of its proper divisors (3006786367).
111003202313 is a wasteful number, since it uses less digits than its factorization.
111003202313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176347.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 111003202313 its reverse (313202300111), we get a palindrome (424205502424).
The spelling of 111003202313 in words is "one hundred eleven billion, three million, two hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •