Base | Representation |
---|---|
bin | 110000010100111010… |
… | …1100010001000000011 |
3 | 100220212200110212001201 |
4 | 1200221311202020003 |
5 | 3200020431124441 |
6 | 115402033242031 |
7 | 10332535626364 |
oct | 1405165421003 |
9 | 326780425051 |
10 | 103781114371 |
11 | 40016808310 |
12 | 18144103317 |
13 | 9a2bc93a1c |
14 | 50472b7b6b |
15 | 2a76174c31 |
hex | 1829d62203 |
103781114371 has 8 divisors (see below), whose sum is σ = 116275647024. Its totient is φ = 91796562720.
The previous prime is 103781114321. The next prime is 103781114443. The reversal of 103781114371 is 173411187301.
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 103781114371 - 221 = 103779017219 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
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 103781114371.
It is not an unprimeable number, because it can be changed into a prime (103781114321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 127494820 + ... + 127495633.
It is an arithmetic number, because the mean of its divisors is an integer number (14534455878).
Almost surely, 2103781114371 is an apocalyptic number.
103781114371 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
103781114371 is a deficient number, since it is larger than the sum of its proper divisors (12494532653).
103781114371 is a wasteful number, since it uses less digits than its factorization.
103781114371 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 254990501.
The product of its (nonzero) digits is 14112, while the sum is 37.
The spelling of 103781114371 in words is "one hundred three billion, seven hundred eighty-one million, one hundred fourteen thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •