Base | Representation |
---|---|
bin | 1100100010110… |
… | …00110101001101 |
3 | 21022222210200212 |
4 | 12101120311031 |
5 | 203414041303 |
6 | 14235132205 |
7 | 2415240041 |
oct | 621306515 |
9 | 238883625 |
10 | 105221453 |
11 | 54438487 |
12 | 2b2a4065 |
13 | 18a5131c |
14 | dd90021 |
15 | 9386ad8 |
hex | 6458d4d |
105221453 has 2 divisors, whose sum is σ = 105221454. Its totient is φ = 105221452.
The previous prime is 105221437. The next prime is 105221461. The reversal of 105221453 is 354122501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84309124 + 20912329 = 9182^2 + 4573^2 .
It is a cyclic number.
It is not a de Polignac number, because 105221453 - 24 = 105221437 is a prime.
It is a super-2 number, since 2×1052214532 = 22143108342862418, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen 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 (105221153) 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, 52610726 + 52610727.
It is an arithmetic number, because the mean of its divisors is an integer number (52610727).
Almost surely, 2105221453 is an apocalyptic number.
It is an amenable number.
105221453 is a deficient number, since it is larger than the sum of its proper divisors (1).
105221453 is an equidigital number, since it uses as much as digits as its factorization.
105221453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 105221453 is about 10257.7508743389. The cubic root of 105221453 is about 472.1008310032.
Adding to 105221453 its reverse (354122501), we get a palindrome (459343954).
The spelling of 105221453 in words is "one hundred five million, two hundred twenty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •