Base | Representation |
---|---|
bin | 10111011100100111111100… |
… | …011001011011100000000101 |
3 | 111112010101011202102200021012 |
4 | 113130213330121123200011 |
5 | 102004023032202144331 |
6 | 1003153350221532005 |
7 | 30502216610130311 |
oct | 2734477431334005 |
9 | 445111152380235 |
10 | 103122104334341 |
11 | 2a948925566564 |
12 | b695908114005 |
13 | 45704acb07b51 |
14 | 1b671ca708b41 |
15 | bdc698ada82b |
hex | 5dc9fc65b805 |
103122104334341 has 16 divisors (see below), whose sum is σ = 107742932818560. Its totient is φ = 98512730585280.
The previous prime is 103122104334307. The next prime is 103122104334371. The reversal of 103122104334341 is 143433401221301.
It is not a de Polignac number, because 103122104334341 - 226 = 103122037225477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103122104334298 and 103122104334307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103122104334371) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 286835906 + ... + 287195196.
It is an arithmetic number, because the mean of its divisors is an integer number (6733933301160).
Almost surely, 2103122104334341 is an apocalyptic number.
It is an amenable number.
103122104334341 is a deficient number, since it is larger than the sum of its proper divisors (4620828484219).
103122104334341 is a wasteful number, since it uses less digits than its factorization.
103122104334341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375196.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 103122104334341 its reverse (143433401221301), we get a palindrome (246555505555642).
The spelling of 103122104334341 in words is "one hundred three trillion, one hundred twenty-two billion, one hundred four million, three hundred thirty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •