Base | Representation |
---|---|
bin | 110000010010001000… |
… | …1110011111011100100 |
3 | 100220122012000020122121 |
4 | 1200210101303323210 |
5 | 3144323043122121 |
6 | 115344502435324 |
7 | 10330324205461 |
oct | 1404421637344 |
9 | 326565006577 |
10 | 103687864036 |
11 | 3aa79106a19 |
12 | 18118a32b44 |
13 | 9a15874503 |
14 | 5038b62668 |
15 | 2a6cda5141 |
hex | 1824473ee4 |
103687864036 has 27 divisors (see below), whose sum is σ = 182499985353. Its totient is φ = 51546720480.
The previous prime is 103687864009. The next prime is 103687864037. The reversal of 103687864036 is 630468786301.
It is a happy number.
The square root of 103687864036 is 322006.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 21056912100 + 82630951936 = 145110^2 + 287456^2 .
It is a Smith number, since the sum of its digits (52) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103687864037) 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 8 ways as a sum of consecutive naturals, for example, 150054451 + ... + 150055141.
Almost surely, 2103687864036 is an apocalyptic number.
103687864036 is the 322006-th square number.
It is an amenable number.
103687864036 is a deficient number, since it is larger than the sum of its proper divisors (78812121317).
103687864036 is an frugal number, since it uses more digits than its factorization.
103687864036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1852 (or 926 counting only the distinct ones).
The product of its (nonzero) digits is 3483648, while the sum is 52.
The spelling of 103687864036 in words is "one hundred three billion, six hundred eighty-seven million, eight hundred sixty-four thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •