Base | Representation |
---|---|
bin | 11110011000111110110… |
… | …10100100010100011101 |
3 | 10200211021101020221021021 |
4 | 33030133122210110131 |
5 | 114102012223024013 |
6 | 2115411210004141 |
7 | 135304231332421 |
oct | 17143732442435 |
9 | 3624241227237 |
10 | 1044204111133 |
11 | 372931aa8947 |
12 | 14a459a16651 |
13 | 77611336111 |
14 | 3877b0dab81 |
15 | 1c267390a8d |
hex | f31f6a451d |
1044204111133 has 16 divisors (see below), whose sum is σ = 1071853865856. Its totient is φ = 1016865420480.
The previous prime is 1044204111061. The next prime is 1044204111149. The reversal of 1044204111133 is 3311114024401.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1044204111133 is a prime.
It is a super-2 number, since 2×10442041111332 (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 = 1044204111098 and 1044204111107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1044204121133) 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, 6459888 + ... + 6619558.
It is an arithmetic number, because the mean of its divisors is an integer number (66990866616).
Almost surely, 21044204111133 is an apocalyptic number.
It is an amenable number.
1044204111133 is a deficient number, since it is larger than the sum of its proper divisors (27649754723).
1044204111133 is a wasteful number, since it uses less digits than its factorization.
1044204111133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160644.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1044204111133 its reverse (3311114024401), we get a palindrome (4355318135534).
The spelling of 1044204111133 in words is "one trillion, forty-four billion, two hundred four million, one hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •