Base | Representation |
---|---|
bin | 100000111100000… |
… | …1111101010010101 |
3 | 2212000202012011001 |
4 | 1001320033222111 |
5 | 4230421411003 |
6 | 301401343301 |
7 | 36250403563 |
oct | 10170175225 |
9 | 2760665131 |
10 | 1105263253 |
11 | 51798a706 |
12 | 26a197b31 |
13 | 147ca4533 |
14 | a6b0ca33 |
15 | 6707561d |
hex | 41e0fa95 |
1105263253 has 2 divisors, whose sum is σ = 1105263254. Its totient is φ = 1105263252.
The previous prime is 1105263251. The next prime is 1105263311. The reversal of 1105263253 is 3523625011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 560647684 + 544615569 = 23678^2 + 23337^2 .
It is a cyclic number.
It is not a de Polignac number, because 1105263253 - 21 = 1105263251 is a prime.
Together with 1105263251, 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 (1105263251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552631626 + 552631627.
It is an arithmetic number, because the mean of its divisors is an integer number (552631627).
Almost surely, 21105263253 is an apocalyptic number.
It is an amenable number.
1105263253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105263253 is an equidigital number, since it uses as much as digits as its factorization.
1105263253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 1105263253 is about 33245.4997405664. The cubic root of 1105263253 is about 1033.9239060340.
Adding to 1105263253 its reverse (3523625011), we get a palindrome (4628888264).
It can be divided in two parts, 11052 and 63253, that added together give a triangular number (74305 = T385).
The spelling of 1105263253 in words is "one billion, one hundred five million, two hundred sixty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •