Base | Representation |
---|---|
bin | 101010000011100… |
… | …0010101101011101 |
3 | 10122100021221112112 |
4 | 1110013002231131 |
5 | 10342222213003 |
6 | 352005243405 |
7 | 46653266126 |
oct | 12407025535 |
9 | 3570257475 |
10 | 1411132253 |
11 | 664602603 |
12 | 334703565 |
13 | 1964787cb |
14 | d55ad04d |
15 | 83d433d8 |
hex | 541c2b5d |
1411132253 has 2 divisors, whose sum is σ = 1411132254. Its totient is φ = 1411132252.
The previous prime is 1411132187. The next prime is 1411132319. The reversal of 1411132253 is 3522311141.
It is a balanced prime because it is at equal distance from previous prime (1411132187) and next prime (1411132319).
It can be written as a sum of positive squares in only one way, i.e., 1231518649 + 179613604 = 35093^2 + 13402^2 .
It is a cyclic number.
It is not a de Polignac number, because 1411132253 - 214 = 1411115869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1411132153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 705566126 + 705566127.
It is an arithmetic number, because the mean of its divisors is an integer number (705566127).
Almost surely, 21411132253 is an apocalyptic number.
It is an amenable number.
1411132253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1411132253 is an equidigital number, since it uses as much as digits as its factorization.
1411132253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 720, while the sum is 23.
The square root of 1411132253 is about 37565.0403034524. The cubic root of 1411132253 is about 1121.6462432361.
Adding to 1411132253 its reverse (3522311141), we get a palindrome (4933443394).
It can be divided in two parts, 14111 and 32253, that added together give a palindrome (46364).
The spelling of 1411132253 in words is "one billion, four hundred eleven million, one hundred thirty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •