Base | Representation |
---|---|
bin | 11110101001110001101… |
… | …11101010111100000011 |
3 | 10201200112210022201001022 |
4 | 33110320313222330003 |
5 | 114223444100333121 |
6 | 2123502035300055 |
7 | 136043541453446 |
oct | 17247067527403 |
9 | 3650483281038 |
10 | 1053221105411 |
11 | 376739947132 |
12 | 15015574a62b |
13 | 7841a4866a7 |
14 | 38d9489765d |
15 | 1c5e3cc7aab |
hex | f538deaf03 |
1053221105411 has 4 divisors (see below), whose sum is σ = 1053254020800. Its totient is φ = 1053188190024.
The previous prime is 1053221105401. The next prime is 1053221105423. The reversal of 1053221105411 is 1145011223501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1053221105411 - 230 = 1052147363587 is a prime.
It is a super-2 number, since 2×10532211054112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1053221105401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16409651 + ... + 16473708.
It is an arithmetic number, because the mean of its divisors is an integer number (263313505200).
Almost surely, 21053221105411 is an apocalyptic number.
1053221105411 is a deficient number, since it is larger than the sum of its proper divisors (32915389).
1053221105411 is an equidigital number, since it uses as much as digits as its factorization.
1053221105411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32915388.
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 1053221105411 its reverse (1145011223501), we get a palindrome (2198232328912).
The spelling of 1053221105411 in words is "one trillion, fifty-three billion, two hundred twenty-one million, one hundred five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •