Base | Representation |
---|---|
bin | 10010110100011001… |
… | …10000111100101101 |
3 | 222002010000021102002 |
4 | 21122030300330231 |
5 | 131142411332003 |
6 | 4350311142045 |
7 | 505240016534 |
oct | 113214607455 |
9 | 28063007362 |
10 | 10103230253 |
11 | 4315012476 |
12 | 1b5b674925 |
13 | c501c236c |
14 | 6bbb5531b |
15 | 3e1e9ea88 |
hex | 25a330f2d |
10103230253 has 2 divisors, whose sum is σ = 10103230254. Its totient is φ = 10103230252.
The previous prime is 10103230219. The next prime is 10103230307. The reversal of 10103230253 is 35203230101.
10103230253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5597733124 + 4505497129 = 74818^2 + 67123^2 .
It is a cyclic number.
It is not a de Polignac number, because 10103230253 - 210 = 10103229229 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10103230213) 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 as a sum of consecutive naturals, namely, 5051615126 + 5051615127.
It is an arithmetic number, because the mean of its divisors is an integer number (5051615127).
Almost surely, 210103230253 is an apocalyptic number.
It is an amenable number.
10103230253 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103230253 is an equidigital number, since it uses as much as digits as its factorization.
10103230253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 20.
Adding to 10103230253 its reverse (35203230101), we get a palindrome (45306460354).
The spelling of 10103230253 in words is "ten billion, one hundred three million, two hundred thirty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •