Base | Representation |
---|---|
bin | 110000011001011011… |
… | …1110001011111100110 |
3 | 100221021020201000201111 |
4 | 1200302313301133212 |
5 | 3200323232242200 |
6 | 115425050215234 |
7 | 10336356226054 |
oct | 1406267613746 |
9 | 327236630644 |
10 | 103932696550 |
11 | 40094330241 |
12 | 18186a2451a |
13 | 9a544c7b17 |
14 | 505d4951d4 |
15 | 2a846180ba |
hex | 1832df17e6 |
103932696550 has 24 divisors (see below), whose sum is σ = 193323314016. Its totient is φ = 41571251040.
The previous prime is 103932696541. The next prime is 103932696583. The reversal of 103932696550 is 55696239301.
It is a junction number, because it is equal to n+sod(n) for n = 103932696494 and 103932696503.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2110812 + ... + 2159488.
It is an arithmetic number, because the mean of its divisors is an integer number (8055138084).
Almost surely, 2103932696550 is an apocalyptic number.
103932696550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103932696550 is a deficient number, since it is larger than the sum of its proper divisors (89390617466).
103932696550 is a wasteful number, since it uses less digits than its factorization.
103932696550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91392 (or 91387 counting only the distinct ones).
The product of its (nonzero) digits is 1312200, while the sum is 49.
The spelling of 103932696550 in words is "one hundred three billion, nine hundred thirty-two million, six hundred ninety-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •