Base | Representation |
---|---|
bin | 100111000111… |
… | …000011101011 |
3 | 201021212211002 |
4 | 213013003223 |
5 | 10111040043 |
6 | 1003425215 |
7 | 153100511 |
oct | 47070353 |
9 | 21255732 |
10 | 10252523 |
11 | 5872966 |
12 | 352520b |
13 | 217c7a8 |
14 | 150c4b1 |
15 | d77bb8 |
hex | 9c70eb |
10252523 has 2 divisors, whose sum is σ = 10252524. Its totient is φ = 10252522.
The previous prime is 10252519. The next prime is 10252553. The reversal of 10252523 is 32525201.
It is a weak prime.
It is an emirp because it is prime and its reverse (32525201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10252523 - 22 = 10252519 is a prime.
It is a super-2 number, since 2×102525232 = 210228455731058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10252495 and 10252504.
It is not a weakly prime, because it can be changed into another prime (10252553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5126261 + 5126262.
It is an arithmetic number, because the mean of its divisors is an integer number (5126262).
Almost surely, 210252523 is an apocalyptic number.
10252523 is a deficient number, since it is larger than the sum of its proper divisors (1).
10252523 is an equidigital number, since it uses as much as digits as its factorization.
10252523 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 600, while the sum is 20.
The square root of 10252523 is about 3201.9561208736. The cubic root of 10252523 is about 217.2418957967.
Adding to 10252523 its reverse (32525201), we get a palindrome (42777724).
It can be divided in two parts, 102 and 52523, that added together give a palindrome (52625).
The spelling of 10252523 in words is "ten million, two hundred fifty-two thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •