Base | Representation |
---|---|
bin | 1100100011100… |
… | …11101011111101 |
3 | 21100012101120221 |
4 | 12101303223331 |
5 | 203431101303 |
6 | 14241341341 |
7 | 2416205533 |
oct | 621635375 |
9 | 240171527 |
10 | 105331453 |
11 | 54503097 |
12 | 2b337851 |
13 | 18a8c406 |
14 | ddbc153 |
15 | 93a94bd |
hex | 6473afd |
105331453 has 2 divisors, whose sum is σ = 105331454. Its totient is φ = 105331452.
The previous prime is 105331441. The next prime is 105331469. The reversal of 105331453 is 354133501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 61811044 + 43520409 = 7862^2 + 6597^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105331453 is a prime.
It is a super-2 number, since 2×1053314532 = 22189429982182418, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105331403) 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, 52665726 + 52665727.
It is an arithmetic number, because the mean of its divisors is an integer number (52665727).
Almost surely, 2105331453 is an apocalyptic number.
It is an amenable number.
105331453 is a deficient number, since it is larger than the sum of its proper divisors (1).
105331453 is an equidigital number, since it uses as much as digits as its factorization.
105331453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 105331453 is about 10263.1112729036. Note that the first 3 decimals coincide. The cubic root of 105331453 is about 472.2652873440.
Adding to 105331453 its reverse (354133501), we get a palindrome (459464954).
The spelling of 105331453 in words is "one hundred five million, three hundred thirty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •