Base | Representation |
---|---|
bin | 11110101011010011100… |
… | …11111100111101001101 |
3 | 10201202200000101100120201 |
4 | 33111221303330331031 |
5 | 114232134301323341 |
6 | 2124115330413501 |
7 | 136103101664623 |
oct | 17255163747515 |
9 | 3652600340521 |
10 | 1054042214221 |
11 | 377020395357 |
12 | 150344731291 |
13 | 7851b61a5a9 |
14 | 39031959513 |
15 | 1c640e1e331 |
hex | f569cfcf4d |
1054042214221 has 16 divisors (see below), whose sum is σ = 1108557797760. Its totient is φ = 1000746774720.
The previous prime is 1054042214201. The next prime is 1054042214231. The reversal of 1054042214221 is 1224122404501.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1054042214221 is a prime.
It is a super-2 number, since 2×10540422142212 (a number of 25 digits) contains 22 as substring.
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 1054042214221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054042214201) 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, 6756526 + ... + 6910768.
It is an arithmetic number, because the mean of its divisors is an integer number (69284862360).
Almost surely, 21054042214221 is an apocalyptic number.
It is an amenable number.
1054042214221 is a deficient number, since it is larger than the sum of its proper divisors (54515583539).
1054042214221 is a wasteful number, since it uses less digits than its factorization.
1054042214221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158196.
The product of its (nonzero) digits is 5120, while the sum is 28.
Adding to 1054042214221 its reverse (1224122404501), we get a palindrome (2278164618722).
The spelling of 1054042214221 in words is "one trillion, fifty-four billion, forty-two million, two hundred fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •