Base | Representation |
---|---|
bin | 11110101001110000110… |
… | …01111010100100110111 |
3 | 10201200112020122102002111 |
4 | 33110320121322210313 |
5 | 114223440101231033 |
6 | 2123501200151451 |
7 | 136043415245236 |
oct | 17247031724467 |
9 | 3650466572074 |
10 | 1053213305143 |
11 | 3767354a972a |
12 | 150153008587 |
13 | 7841898514c |
14 | 38d93826b1d |
15 | 1c5e32867cd |
hex | f53867a937 |
1053213305143 has 2 divisors, whose sum is σ = 1053213305144. Its totient is φ = 1053213305142.
The previous prime is 1053213305141. The next prime is 1053213305149. The reversal of 1053213305143 is 3415033123501.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1053213305143 - 21 = 1053213305141 is a prime.
It is a super-2 number, since 2×10532133051432 (a number of 25 digits) contains 22 as substring.
Together with 1053213305141, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1053213305141) 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 as a sum of consecutive naturals, namely, 526606652571 + 526606652572.
It is an arithmetic number, because the mean of its divisors is an integer number (526606652572).
Almost surely, 21053213305143 is an apocalyptic number.
1053213305143 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053213305143 is an equidigital number, since it uses as much as digits as its factorization.
1053213305143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 1053213305143 its reverse (3415033123501), we get a palindrome (4468246428644).
The spelling of 1053213305143 in words is "one trillion, fifty-three billion, two hundred thirteen million, three hundred five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •