Base | Representation |
---|---|

bin | 10000010110000100100… |

… | …101111110001111011001 |

3 | 10222101012111200022001001 |

4 | 100112010211332033121 |

5 | 121400314004323113 |

6 | 2215555050025001 |

7 | 144102134031436 |

oct | 20260445761731 |

9 | 3871174608031 |

10 | 1123211011033 |

11 | 3a3395374141 |

12 | 161829118161 |

13 | 81bc27a8527 |

14 | 3c514002b8d |

15 | 1e33d5927dd |

hex | 1058497e3d9 |

1123211011033 has 8 divisors (see below), whose sum is σ = 1152068450400. Its totient is φ = 1094423193120.

The previous prime is 1123211011007. The next prime is 1123211011051. The reversal of 1123211011033 is 3301101123211.

Adding to 1123211011033 its reverse (3301101123211), we get a palindrome (4424312134244).

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 1123211011033 - 2^{5} = 1123211011001 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number *n* which added to its sum of digits gives 1123211011033.

It is not an unprimeable number, because it can be changed into a prime (1123211011333) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17372683 + ... + 17437216.

It is an arithmetic number, because the mean of its divisors is an integer number (144008556300).

Almost surely, 2^{1123211011033} is an apocalyptic number.

It is an amenable number.

1123211011033 is a deficient number, since it is larger than the sum of its proper divisors (28857439367).

1123211011033 is an equidigital number, since it uses as much as digits as its factorization.

1123211011033 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 34810727.

The product of its (nonzero) digits is 108, while the sum is 19.

The spelling of 1123211011033 in words is "one trillion, one hundred twenty-three billion, two hundred eleven million, eleven thousand, thirty-three".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •