Base | Representation |
---|---|
bin | 10000000001011110110… |
… | …110101001110101100111 |
3 | 10220021010202120122102100 |
4 | 100001132312221311213 |
5 | 121020024332410343 |
6 | 2201501214543143 |
7 | 142360234120353 |
oct | 20013666516547 |
9 | 3807122518370 |
10 | 1101103013223 |
11 | 394a7aa44174 |
12 | 159499207ab3 |
13 | 7caab472615 |
14 | 3b417b8c463 |
15 | 1d99772e9d3 |
hex | 1005eda9d67 |
1101103013223 has 12 divisors (see below), whose sum is σ = 1598019962968. Its totient is φ = 730589675760.
The previous prime is 1101103013221. The next prime is 1101103013293. The reversal of 1101103013223 is 3223103011011.
It is not a de Polignac number, because 1101103013223 - 21 = 1101103013221 is a prime.
It is a super-2 number, since 2×11011030132232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101103013196 and 1101103013205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101103013221) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 289914640 + ... + 289918437.
Almost surely, 21101103013223 is an apocalyptic number.
1101103013223 is a deficient number, since it is larger than the sum of its proper divisors (496916949745).
1101103013223 is a wasteful number, since it uses less digits than its factorization.
1101103013223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 579833294 (or 579833291 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1101103013223 its reverse (3223103011011), we get a palindrome (4324206024234).
The spelling of 1101103013223 in words is "one trillion, one hundred one billion, one hundred three million, thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •