Base | Representation |
---|---|
bin | 110000010010001110… |
… | …0001010000010100101 |
3 | 100220122101010000211002 |
4 | 1200210130022002211 |
5 | 3144324241413122 |
6 | 115345040523045 |
7 | 10330356232256 |
oct | 1404434120245 |
9 | 326571100732 |
10 | 103690576037 |
11 | 3aa7a699544 |
12 | 18119920485 |
13 | 9a162b3a49 |
14 | 503926ab2d |
15 | 2a6d23d992 |
hex | 182470a0a5 |
103690576037 has 16 divisors (see below), whose sum is σ = 106767324720. Its totient is φ = 100628656128.
The previous prime is 103690576009. The next prime is 103690576057. The reversal of 103690576037 is 730675096301.
It can be written as a sum of positive squares in 8 ways, for example, as 571879396 + 103118696641 = 23914^2 + 321121^2 .
It is a cyclic number.
It is not a de Polignac number, because 103690576037 - 26 = 103690575973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103690575982 and 103690576000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103690576007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28045373 + ... + 28049069.
It is an arithmetic number, because the mean of its divisors is an integer number (6672957795).
Almost surely, 2103690576037 is an apocalyptic number.
It is an amenable number.
103690576037 is a deficient number, since it is larger than the sum of its proper divisors (3076748683).
103690576037 is an equidigital number, since it uses as much as digits as its factorization.
103690576037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5480.
The product of its (nonzero) digits is 714420, while the sum is 47.
The spelling of 103690576037 in words is "one hundred three billion, six hundred ninety million, five hundred seventy-six thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •