Base | Representation |
---|---|
bin | 110000000110101001… |
… | …1000011010010011001 |
3 | 100212122022112020012210 |
4 | 1200031103003102121 |
5 | 3143030343004423 |
6 | 115242331025333 |
7 | 10314633113346 |
oct | 1401523032231 |
9 | 325568466183 |
10 | 103302313113 |
11 | 3a8a050a89a |
12 | 1802b89b249 |
13 | 9983a2187c |
14 | 4ddd87d7cd |
15 | 2a490e7b93 |
hex | 180d4c3499 |
103302313113 has 8 divisors (see below), whose sum is σ = 137742616000. Its totient is φ = 68865109488.
The previous prime is 103302313097. The next prime is 103302313139. The reversal of 103302313113 is 311313203301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103302313113 - 24 = 103302313097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103302313113.
It is not an unprimeable number, because it can be changed into a prime (103302313613) 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, 695893 + ... + 831186.
It is an arithmetic number, because the mean of its divisors is an integer number (17217827000).
Almost surely, 2103302313113 is an apocalyptic number.
It is an amenable number.
103302313113 is a deficient number, since it is larger than the sum of its proper divisors (34440302887).
103302313113 is a wasteful number, since it uses less digits than its factorization.
103302313113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1549631.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 103302313113 its reverse (311313203301), we get a palindrome (414615516414).
The spelling of 103302313113 in words is "one hundred three billion, three hundred two million, three hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •