Base | Representation |
---|---|
bin | 10000000011100101110… |
… | …111010110101111110001 |
3 | 10220110222121210001121011 |
4 | 100003211313112233301 |
5 | 121034144214340304 |
6 | 2202514052030521 |
7 | 142500330200155 |
oct | 20034567265761 |
9 | 3813877701534 |
10 | 1103368121329 |
11 | 395a325a3441 |
12 | 159a0b902441 |
13 | 8007c81bc86 |
14 | 3b590937065 |
15 | 1da7b50cc04 |
hex | 100e5dd6bf1 |
1103368121329 has 16 divisors (see below), whose sum is σ = 1189482703056. Its totient is φ = 1019669299200.
The previous prime is 1103368121311. The next prime is 1103368121351. The reversal of 1103368121329 is 9231218633011.
It can be written as a sum of positive squares in 8 ways, for example, as 22485602304 + 1080882519025 = 149952^2 + 1039655^2 .
It is a cyclic number.
It is not a de Polignac number, because 1103368121329 - 29 = 1103368120817 is a prime.
It is a super-2 number, since 2×11033681213292 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1103368121291 and 1103368121300.
It is not an unprimeable number, because it can be changed into a prime (1103368121389) 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, 323662 + ... + 1520359.
It is an arithmetic number, because the mean of its divisors is an integer number (74342668941).
Almost surely, 21103368121329 is an apocalyptic number.
It is an amenable number.
1103368121329 is a deficient number, since it is larger than the sum of its proper divisors (86114581727).
1103368121329 is a wasteful number, since it uses less digits than its factorization.
1103368121329 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1844676.
The product of its (nonzero) digits is 46656, while the sum is 40.
The spelling of 1103368121329 in words is "one trillion, one hundred three billion, three hundred sixty-eight million, one hundred twenty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •