Base | Representation |
---|---|
bin | 100000110110100… |
… | …0011110010101101 |
3 | 2211211020012221001 |
4 | 1001231003302231 |
5 | 4224144043203 |
6 | 301214440301 |
7 | 36213442105 |
oct | 10155036255 |
9 | 2754205831 |
10 | 1102331053 |
11 | 5162676aa |
12 | 269203091 |
13 | 1474b89c5 |
14 | a6588205 |
15 | 66b9691d |
hex | 41b43cad |
1102331053 has 2 divisors, whose sum is σ = 1102331054. Its totient is φ = 1102331052.
The previous prime is 1102330993. The next prime is 1102331059. The reversal of 1102331053 is 3501332011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1008570564 + 93760489 = 31758^2 + 9683^2 .
It is an emirp because it is prime and its reverse (3501332011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1102331053 - 213 = 1102322861 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1102331053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102331059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551165526 + 551165527.
It is an arithmetic number, because the mean of its divisors is an integer number (551165527).
Almost surely, 21102331053 is an apocalyptic number.
It is an amenable number.
1102331053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102331053 is an equidigital number, since it uses as much as digits as its factorization.
1102331053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 1102331053 is about 33201.3712518022. The cubic root of 1102331053 is about 1033.0087826979.
Adding to 1102331053 its reverse (3501332011), we get a palindrome (4603663064).
The spelling of 1102331053 in words is "one billion, one hundred two million, three hundred thirty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •