Base | Representation |
---|---|
bin | 110000000111101011… |
… | …0010000010101101110 |
3 | 100212201201020122100200 |
4 | 1200033112100111232 |
5 | 3143113144114223 |
6 | 115250000134330 |
7 | 10315531343346 |
oct | 1401726202556 |
9 | 325651218320 |
10 | 103336707438 |
11 | 3a908971858 |
12 | 1803b3073a6 |
13 | 998aba4a43 |
14 | 5004273d26 |
15 | 2a4c13da43 |
hex | 180f59056e |
103336707438 has 12 divisors (see below), whose sum is σ = 223896199488. Its totient is φ = 34445569140.
The previous prime is 103336707437. The next prime is 103336707451. The reversal of 103336707438 is 834707633301.
It is a junction number, because it is equal to n+sod(n) for n = 103336707393 and 103336707402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103336707437) 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 5 ways as a sum of consecutive naturals, for example, 2870464078 + ... + 2870464113.
It is an arithmetic number, because the mean of its divisors is an integer number (18658016624).
Almost surely, 2103336707438 is an apocalyptic number.
103336707438 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
103336707438 is an abundant number, since it is smaller than the sum of its proper divisors (120559492050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103336707438 is a wasteful number, since it uses less digits than its factorization.
103336707438 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5740928199 (or 5740928196 counting only the distinct ones).
The product of its (nonzero) digits is 762048, while the sum is 45.
The spelling of 103336707438 in words is "one hundred three billion, three hundred thirty-six million, seven hundred seven thousand, four hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •