Base | Representation |
---|---|
bin | 110000000110101110… |
… | …1111110000100010001 |
3 | 100212122111220122102012 |
4 | 1200031131332010101 |
5 | 3143032111102223 |
6 | 115242512232305 |
7 | 10314666334064 |
oct | 1401535760421 |
9 | 325574818365 |
10 | 103305175313 |
11 | 3a8a209524a |
12 | 1803083b695 |
13 | 99844b4592 |
14 | 4ddddc68db |
15 | 2a494b0c78 |
hex | 180d77e111 |
103305175313 has 8 divisors (see below), whose sum is σ = 104662097280. Its totient is φ = 101949485040.
The previous prime is 103305175297. The next prime is 103305175319. The reversal of 103305175313 is 313571503301.
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 103305175313 - 24 = 103305175297 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 103305175313.
It is not an unprimeable number, because it can be changed into a prime (103305175319) 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, 138470 + ... + 475167.
It is an arithmetic number, because the mean of its divisors is an integer number (13082762160).
Almost surely, 2103305175313 is an apocalyptic number.
It is an amenable number.
103305175313 is a deficient number, since it is larger than the sum of its proper divisors (1356921967).
103305175313 is an equidigital number, since it uses as much as digits as its factorization.
103305175313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 615847.
The product of its (nonzero) digits is 14175, while the sum is 32.
Adding to 103305175313 its reverse (313571503301), we get a palindrome (416876678614).
The spelling of 103305175313 in words is "one hundred three billion, three hundred five million, one hundred seventy-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •