Base | Representation |
---|---|
bin | 1100010110101… |
… | …10110000001110 |
3 | 21020000110110102 |
4 | 12023112300032 |
5 | 203012440303 |
6 | 14141211102 |
7 | 2365632443 |
oct | 613266016 |
9 | 236013412 |
10 | 103640078 |
11 | 53558363 |
12 | 2a860a92 |
13 | 186195b9 |
14 | da9b9ca |
15 | 9173288 |
hex | 62d6c0e |
103640078 has 4 divisors (see below), whose sum is σ = 155460120. Its totient is φ = 51820038.
The previous prime is 103640077. The next prime is 103640081. The reversal of 103640078 is 870046301.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×1036400783 (a number of 25 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103640078.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103640077) 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 as a sum of consecutive naturals, namely, 25910018 + ... + 25910021.
It is an arithmetic number, because the mean of its divisors is an integer number (38865030).
Almost surely, 2103640078 is an apocalyptic number.
103640078 is a deficient number, since it is larger than the sum of its proper divisors (51820042).
103640078 is an equidigital number, since it uses as much as digits as its factorization.
103640078 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51820041.
The product of its (nonzero) digits is 4032, while the sum is 29.
The square root of 103640078 is about 10180.3771049996. The cubic root of 103640078 is about 469.7238123839.
Adding to 103640078 its reverse (870046301), we get a palindrome (973686379).
It can be divided in two parts, 1036 and 40078, that added together give a palindrome (41114).
The spelling of 103640078 in words is "one hundred three million, six hundred forty thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •