Base | Representation |
---|---|
bin | 10000000011100100010… |
… | …000011001000111101101 |
3 | 10220110220201222202202111 |
4 | 100003210100121013231 |
5 | 121034120312131341 |
6 | 2202511245324021 |
7 | 142466551602661 |
oct | 20034420310755 |
9 | 3813821882674 |
10 | 1103341130221 |
11 | 395a19338640 |
12 | 159a02866611 |
13 | 8007705b6c5 |
14 | 3b58b10c8a1 |
15 | 1da78e7a681 |
hex | 100e44191ed |
1103341130221 has 16 divisors (see below), whose sum is σ = 1221885995328. Its totient is φ = 987843225600.
The previous prime is 1103341130183. The next prime is 1103341130231. The reversal of 1103341130221 is 1220311433011.
It is not a de Polignac number, because 1103341130221 - 213 = 1103341122029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1103341130192 and 1103341130201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103341130231) 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, 3135451 + ... + 3469543.
It is an arithmetic number, because the mean of its divisors is an integer number (76367874708).
Almost surely, 21103341130221 is an apocalyptic number.
1103341130221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1103341130221 is a deficient number, since it is larger than the sum of its proper divisors (118544865107).
1103341130221 is a wasteful number, since it uses less digits than its factorization.
1103341130221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 338652.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1103341130221 its reverse (1220311433011), we get a palindrome (2323652563232).
The spelling of 1103341130221 in words is "one trillion, one hundred three billion, three hundred forty-one million, one hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •