Base | Representation |
---|---|
bin | 100101010100001… |
… | …1000111110101111 |
3 | 10020021001101010111 |
4 | 1022220120332233 |
5 | 10031014231223 |
6 | 324124520451 |
7 | 43012456222 |
oct | 11250307657 |
9 | 3207041114 |
10 | 1252102063 |
11 | 5928628a3 |
12 | 2ab3b0127 |
13 | 16c5375c4 |
14 | bc4135b9 |
15 | 74dcd30d |
hex | 4aa18faf |
1252102063 has 4 divisors (see below), whose sum is σ = 1258036408. Its totient is φ = 1246167720.
The previous prime is 1252102031. The next prime is 1252102067. The reversal of 1252102063 is 3602012521.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3602012521 = 113 ⋅31876217.
It is a cyclic number.
It is not a de Polignac number, because 1252102063 - 25 = 1252102031 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1252102067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2966856 + ... + 2967277.
It is an arithmetic number, because the mean of its divisors is an integer number (314509102).
Almost surely, 21252102063 is an apocalyptic number.
1252102063 is a deficient number, since it is larger than the sum of its proper divisors (5934345).
1252102063 is an equidigital number, since it uses as much as digits as its factorization.
1252102063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5934344.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 1252102063 is about 35385.0542319777. The cubic root of 1252102063 is about 1077.8208411788.
Adding to 1252102063 its reverse (3602012521), we get a palindrome (4854114584).
The spelling of 1252102063 in words is "one billion, two hundred fifty-two million, one hundred two thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •