Base | Representation |
---|---|
bin | 110000001111101100… |
… | …1001100010111001111 |
3 | 100220102110210201000111 |
4 | 1200133121030113033 |
5 | 3144141103204124 |
6 | 115332414140451 |
7 | 10325310505336 |
oct | 1403731142717 |
9 | 326373721014 |
10 | 103605913039 |
11 | 3aa36922a22 |
12 | 180b54b1727 |
13 | 9a018b00b5 |
14 | 502bd0cd1d |
15 | 2a65ab8494 |
hex | 181f64c5cf |
103605913039 has 4 divisors (see below), whose sum is σ = 107178530760. Its totient is φ = 100033295320.
The previous prime is 103605913003. The next prime is 103605913069. The reversal of 103605913039 is 930319506301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 930319506301 = 23 ⋅40448674187.
It is a cyclic number.
It is not a de Polignac number, because 103605913039 - 27 = 103605912911 is a prime.
It is a super-3 number, since 3×1036059130393 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103605912992 and 103605913010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103605913069) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1786308817 + ... + 1786308874.
It is an arithmetic number, because the mean of its divisors is an integer number (26794632690).
Almost surely, 2103605913039 is an apocalyptic number.
103605913039 is a deficient number, since it is larger than the sum of its proper divisors (3572617721).
103605913039 is an equidigital number, since it uses as much as digits as its factorization.
103605913039 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3572617720.
The product of its (nonzero) digits is 65610, while the sum is 40.
The spelling of 103605913039 in words is "one hundred three billion, six hundred five million, nine hundred thirteen thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •